#include<bits/stdc++.h>
using namespace std;
const int MaxN=3e5;
const int MaxA=1e7;
int num[MaxN+1];
int pos[MaxN+1];
long prS[MaxN+1];
bool comp(int lhs,int rhs){
return num[lhs]<num[rhs]; }
int main(){
int N;
cin>>N;
prS[0]=0;
for(int n=1; n<=N; n+=1){
cin>>num[n];
prS[n]=prS[n-1]+num[n];
}
iota(pos+1, pos+1+N, 1);
sort(pos+1, pos+1+N,comp);
int L=1, R=N;
for(int n=1; n<=N; n+=1){
int p=pos[n];
if( (L<=p && p<=R)==0 )
continue;
long sumL=prS[p-1]-prS[L-1];
long sumR=prS[ R ]-prS[ p ];
(sumL<=sumR)? L=p+1: R=p-1;
if( L==R )
break;
}
cout<<num[L];
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmNvbnN0IGludCBNYXhOPTNlNTsKY29uc3QgaW50IE1heEE9MWU3OwoKaW50IG51bVtNYXhOKzFdOwppbnQgcG9zW01heE4rMV07CmxvbmcgcHJTW01heE4rMV07Cgpib29sIGNvbXAoaW50IGxocyxpbnQgcmhzKXsKCXJldHVybiBudW1bbGhzXTxudW1bcmhzXTsgfQoJCmludCBtYWluKCl7CglpbnQgTjsKCQoJY2luPj5OOwoJcHJTWzBdPTA7Cglmb3IoaW50IG49MTsgbjw9Tjsgbis9MSl7CgkJY2luPj5udW1bbl07CgkJcHJTW25dPXByU1tuLTFdK251bVtuXTsKCX0KCglpb3RhKHBvcysxLCBwb3MrMStOLCAxKTsKCXNvcnQocG9zKzEsIHBvcysxK04sY29tcCk7CgkKCWludCBMPTEsIFI9TjsKCWZvcihpbnQgbj0xOyBuPD1OOyBuKz0xKXsKCQlpbnQgcD1wb3Nbbl07CgkJaWYoIChMPD1wICYmIHA8PVIpPT0wICkKCQkJY29udGludWU7CgkJbG9uZyBzdW1MPXByU1twLTFdLXByU1tMLTFdOwoJCWxvbmcgc3VtUj1wclNbIFIgXS1wclNbIHAgXTsKCQkoc3VtTDw9c3VtUik/IEw9cCsxOiBSPXAtMTsKCQlpZiggTD09UiApCgkJCWJyZWFrOwoJfQoJY291dDw8bnVtW0xdOwp9