#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100010;
int a[N],b[N];
int n;
int main()
{
    cin >> n;
    for(int i = 1;i <= n;i ++) cin >> a[i];
    sort(a + 1,a + n + 1);
    int cnt = 1;
    for(int i = 1;i <= n;i ++)
    {
        if(a[i] >= cnt) b[i] = cnt,cnt ++;
        else b[i] = cnt - 1;
    }
    int f = 1;
    for(int i = 1;i <= n;i ++)
    {
        if(b[i] == f) f ++;
    }
    cout << f << endl;
    return 0;
}