#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int MAXA = 1e9 + 9;
int N;
int A[MAXN];
void solve() {
  sort(A, A + N);
  int mex = 1;
  for (int i = 0; i < N; ++i) {
    if (A[i] >= mex) ++mex;
  }
  cout << mex << endl;
}
int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; ++i) scanf("%d", A + i);
  solve();
  return 0;
}
