#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const long long ninf = -1 * inf;
long long dx[4] = {1, -1, 0, 0};
long long dy[4] = {0, 0, 1, -1};
char dir[4] = {'D', 'U', 'R', 'L'};
struct Node {
  long long x, y, l, r;
};
void solve(long long ca) {
  long long n;
  cin >> n;
  vector<long long> vec(n);
  for (long long i = 0; i < n; i++) cin >> vec[i];
  sort(vec.begin(), vec.end());
  long long x = 1;
  for (long long i = 0; i < n; i++) {
    if (vec[i] >= x) x++;
  }
  cout << x;
}
int main() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);
  long long t = 1, ca;
  ca = 1;
  while (t--) {
    solve(ca);
    ca++;
  }
}
