#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
long long n,s,a[5001],max1,p;
int main()
{
    freopen("pooh.in","r",stdin);
    freopen("pooh.out","w",stdout);
    scanf("%lld",&n);
    for(int i=1; i<=n; i++)
    {
        scanf("%lld",&a[i]);
    }
    sort(a+1,a+n+1);
    s=0;
    for(int i=1; i<=n; i++)
    {
        if(a[i]>a[i-1]) {if(max1<=s) {max1=s; p=a[i-1];} s=a[i];}
        else s+=a[i];
    }
    if(max1<=s) {s=max1; p=a[n];}
    printf("%lld\n",p);
    return 0;
}