#include <bits/stdc++.h>
using namespace std;
const int maxn = 1234567;
const int minn = -1234567;
const long long x = 1000000007;
int a[maxn];
vector<int> v1;
map<int, int> m1, m2;
set<int> s1;
vector<pair<int, int> > vp1;
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    m1[a[i]]++;
  }
  sort(a, a + n);
  int cnt = 1;
  for (int i = 0; i < n; i++) {
    if (a[i] >= cnt) cnt++;
  }
  cout << cnt;
}
