#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int a[n];
  vector<int> v;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  if (a[0] > 1) {
    a[0] = 1;
    v.push_back(1);
  } else
    v.push_back(1);
  for (int i = 1; i < n; i++) {
    if (a[i] - a[i - 1] > 1) {
      v.push_back(a[i - 1] + 1);
      a[i] = a[i - 1] + 1;
    } else
      v.push_back(a[i]);
  }
  cout << v[v.size() - 1] + 1 << endl;
  return 0;
}
