#include <bits/stdc++.h>
using namespace std;
vector<int> lt;
int main() {
  int n, el;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> el;
    lt.push_back(el);
  }
  sort(lt.begin(), lt.end());
  int pos = 0;
  int cand = 1;
  while (pos < n) {
    while (pos < n && lt[pos] < cand) {
      pos++;
    }
    if (pos == n) {
      break;
    }
    lt[pos] = cand;
    cand++;
  }
  cout << cand;
  return 0;
}
