#include <iostream>
#include <algorithm>
#include <climits>
using namespace std;
int get_max(int *A, int L, int R){
if (L>R)
return INT_MIN;
if (L==R)
return A[L];
int M=(L+R)>>1;
return max(get_max(A,L,M), get_max(A,M+1,R));
}
int main(){
int A[]={373627,772,73,-233,-1,8737};
int N=sizeof(A)/sizeof(A[0]);
int ans=get_max(A,0,N-1);
cout<<ans<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8Y2xpbWl0cz4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBnZXRfbWF4KGludCAqQSwgaW50IEwsIGludCBSKXsKICAgIGlmIChMPlIpCiAgICAgICByZXR1cm4gSU5UX01JTjsKICAgIGlmIChMPT1SKQogICAgICAgIHJldHVybiBBW0xdOwogICAgaW50IE09KEwrUik+PjE7CiAgICByZXR1cm4gbWF4KGdldF9tYXgoQSxMLE0pLCBnZXRfbWF4KEEsTSsxLFIpKTsKfQppbnQgbWFpbigpewogICAgaW50IEFbXT17MzczNjI3LDc3Miw3MywtMjMzLC0xLDg3Mzd9OwogICAgaW50IE49c2l6ZW9mKEEpL3NpemVvZihBWzBdKTsKICAgIGludCBhbnM9Z2V0X21heChBLDAsTi0xKTsKICAgIGNvdXQ8PGFuczw8ZW5kbDsKICAgIHJldHVybiAwOwp9