#include <bits/stdc++.h>
using namespace std;
int n, a[1000009];
set<int> s;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  int req = 1;
  for (int i = 0; i < n; i++) {
    if (a[i] >= req) {
      s.insert(req);
      req++;
    }
  }
  int curr = 1;
  for (set<int>::iterator it = s.begin(); it != s.end(); it++) {
    if (*it == curr) {
      curr++;
    } else
      break;
  }
  cout << curr << "\n";
  return 0;
}
