#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> vec;
  for (int i = 0; i < n; i++) {
    int num;
    cin >> num;
    vec.push_back(num);
  }
  sort(vec.begin(), vec.end());
  int start = 1;
  set<int> s;
  for (int i = 0; i < n; i++) {
    if (vec[i] > start && s.find(start) == s.end()) {
      vec[i] = start;
      s.insert(start);
      start++;
    } else if (vec[i] == start && s.find(start) == s.end()) {
      s.insert(start);
      start++;
    } else if (vec[i] == start && s.find(start) != s.end()) {
      s.insert(start);
    }
  }
  cout << start << endl;
  return 0;
}
