#include <bits/stdc++.h>
using namespace std;
struct node {
  int a, b;
  bool operator<(const node &n) const { return a < n.a; }
};
int n, m, k;
vector<int> v, v2, v3, v4;
vector<char> vc;
string s;
deque<char> dq;
map<char, int> mp;
int a[30];
int main() {
  int t, t1;
  while (cin >> n) {
    v.clear();
    for (int i = 0; i < n; i++) {
      cin >> t;
      v.push_back(t);
    }
    sort(v.begin(), v.end());
    int cnt = 1;
    for (int i = 0; i < v.size(); i++) {
      if (v[i] >= cnt) {
        cnt++;
      }
    }
    cout << cnt << endl;
  }
  return 0;
}
