#include<bits/stdc++.h>
using namespace std;

const int nmax=1e5+42;

int n,inp[nmax];

int main()
{
    freopen("destruction.in","r",stdin);
    freopen("destruction.out","w",stdout);

    scanf("%i",&n);

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

    sort(inp+1,inp+n+1);

    long long outp=0;

    for(int i=1;i<=n;i++)
        outp=max(outp,1LL*inp[i]+n-i);

    printf("%lld\n",outp);

    return 0;
}