#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;
for(int n=1; n<=N; n+=1)
cin>>num[n];
prS[0]=0;
for(int n=1; n<=N; n+=1)
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];
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKIApjb25zdCBpbnQgTWF4Tj0zZTU7CmNvbnN0IGludCBNYXhBPTFlNzsKIAppbnQgbnVtW01heE4rMV07CmludCBwb3NbTWF4TisxXTsKbG9uZyBwclNbTWF4TisxXTsKIApib29sIGNvbXAoaW50IGxocyxpbnQgcmhzKXsKCXJldHVybiBudW1bbGhzXTxudW1bcmhzXTsgfQogCmludCBtYWluKCl7CglpbnQgTjsKIAoJY2luPj5OOwoJZm9yKGludCBuPTE7IG48PU47IG4rPTEpCgkJY2luPj5udW1bbl07CiAKCXByU1swXT0wOwoJZm9yKGludCBuPTE7IG48PU47IG4rPTEpCgkJcHJTW25dPXByU1tuLTFdK251bVtuXTsKCWlvdGEocG9zKzEsIHBvcysxK04sIDEpOwoJc29ydChwb3MrMSwgcG9zKzErTixjb21wKTsKIAoJaW50IEw9MSwgUj1OOwoJZm9yKGludCBuPTE7IG48PU47IG4rPTEpewoJCWludCBwPXBvc1tuXTsKCQlpZiggKEw8PXAgJiYgcDw9Uik9PTAgKQoJCQljb250aW51ZTsKCQlsb25nIHN1bUw9cHJTW3AtMV0tcHJTW0wtMV07CgkJbG9uZyBzdW1SPXByU1sgUiBdLXByU1sgcCBdOwoJCShzdW1MPD1zdW1SKT8gTD1wKzE6IFI9cC0xOwoJCWlmKCBMPT1SICkKCQkJYnJlYWs7Cgl9Cgljb3V0PDxudW1bTF07Cn0=