#include <bits/stdc++.h>
using namespace std;
const int oo = 1000000009;
const double eps = 1e-9;
const int mod = 1000000007;
int nos[100001], n, pos = 0;
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) scanf("%d", &nos[i]);
  sort(nos, nos + n);
  for (int i = 0; i < n; ++i)
    if (pos + 1 <= nos[i]) ++pos;
  printf("%d\n", pos + 1);
}
