#include <iostream>

#include <cstdio>

#define LL long long

using namespace std;

const int Maxn = ;

int n;

LL sum,a[Maxn];

int main() {

    freopen("lost.in","r",stdin);

    freopen("lost.out","w",stdout);

    scanf("%d",&n);

    for(int i=; i<=n; ++i) scanf("%lld",&a[i]);

    sort(a+,a++n);

    for(int i=; i<=n; ++i) {

        if(sum+<a[i]) {

            printf("%lld",sum+);

            return ;

        }

        else sum+=a[i];

    }

    printf("%lld",sum+);

    return ;

}

#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*.*(x+)>1e18) return true;

    if(n <= x *(x+)) return true;

    return false;

}

int main() {

    freopen("div.in","r",stdin);

    freopen("div.out","w",stdout);

    scanf("%lld",&n);

    if(n==) {

        puts("");

    } else if(n==) {

        puts("");

    } else {

        LL L = ,R=n-;

        while(R-L>) {

            LL mid = (L+R)/;

            if(check(mid)) R=mid;

            else L=mid;

        }

        // assert(check(R));

        printf("%lld\n",L+(n/R));

    }

    return ;

}

#include<cstdio>

#include<iostream>

using namespace std;

const int M = ;

int n,m,vi[M];

double ans[M],pi[M],arcpi[M];

void dfs(int now,int Count,int Money,double k) {

    if(now>n) {

        if(Money>=m) ans[Count]+=k;

        return;

    }

    dfs(now+,Count,Money+vi[now],k*pi[now]);

    dfs(now+,Count+,Money,k*arcpi[now]);

}

int main() {

    freopen("diamond.in","r",stdin);

    freopen("diamond.out","w",stdout);

    scanf("%d%d",&n,&m);

    for(int i=,tmp; i<=n; i++) {

        scanf("%d%d",&vi[i],&tmp);

        pi[i]=1.0*tmp/,arcpi[i]=1.0-pi[i];

    }

    dfs(,,,);

    for(int i=; i<=n; i++) printf("%.3lf\n",ans[i]);

    return ;

}