#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

const int M = 100011;
int n;
long long sum,a[M];

int main() {
    freopen("lost.in","r",stdin);
    freopen("lost.out","w",stdout);
    scanf("%d",&n);
    for(int i=1; i<=n; ++i) scanf("%lld",&a[i]);
    sort(a+1,a+n+1);
    for(int i=1; i<=n; ++i) {
        if(sum+1<a[i]) {
            printf("%lld",sum+1);
            return 0;
        }
        else sum+=a[i];
    }
    printf("%lld",sum+1);
    return 0;
}

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cassert>
using namespace std;

typedef long long LL;
LL n;
bool check(LL x) { // n <= x*(x+1)
    if(x*1.*(x+1)>1e18) return true;
    if(n <= x *(x+1)) return true;
    return false;
}
int main() {
    freopen("div.in","r",stdin);
    freopen("div.out","w",stdout);
    scanf("%lld",&n);
    if(n==1) {
        puts("1");
    } else if(n==2) {
        puts("2");
    } else {
        LL L = 1,R=n-1;
        while(R-L>1) {
            LL mid = (L+R)/2;
            if(check(mid)) R=mid;
            else L=mid;
        }
        // assert(check(R));
        printf("%lld\n",L+(n/R));
    }
    return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn=1005;
int n,m,vi[maxn];
double ans[maxn],pi[maxn],arcpi[maxn];

void dfs(int now,int Count,int Money,double k) {
    if(now>n) {
        if(Money>=m) ans[Count]+=k;
        return;
    }
    dfs(now+1,Count,Money+vi[now],k*pi[now]);
    dfs(now+1,Count+1,Money,k*arcpi[now]);
}
int main() {
    freopen("diamond.in","r",stdin);
    freopen("diamond.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1,tmp; i<=n; i++) {
        scanf("%d%d",&vi[i],&tmp);
        pi[i]=1.0*tmp/100,arcpi[i]=1.0-pi[i];
    }
    dfs(1,0,0,1);
    for(int i=0; i<=n; i++) printf("%.3lf\n",ans[i]);
    return 0;
}