#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long Mod(long long b, long long p, long long m) {
  if (p == 0) return 1;
  long long ans = Mod(b, p / 2, m);
  ans = (ans * ans) % m;
  if (p % 2 == 1) ans = (ans * b) % m;
  return ans;
}
int sz = 75;
void sieve(vector<int>& v) {
  v.assign(sz, 0);
  v[0] = 1;
  v[1] = 1;
  for (int i = 4; i <= sz; i += 2) v[i] = 1;
  for (int i = 3; i * i <= sz; i += 2) {
    if (v[i] == 0) {
      for (int j = i * i; j <= sz; j += i * 2) {
        v[j] = 1;
      }
    }
  }
}
long long Pow(long long b, long long p) {
  long long ans = 1;
  for (long long i = 1; i <= p; i++) {
    ans *= b;
  }
  return ans;
}
void solve() {
  long long n;
  std::vector<long long> v;
  cin >> n;
  for (long long i = 0; i < n; i++) {
    long long a;
    cin >> a;
    v.push_back(a);
  }
  sort(v.begin(), v.end());
  long long cont = 1;
  for (long long i = 0; i < n; i++) {
    if (v[i] >= cont) cont++;
  }
  cout << cont << endl;
}
int main() {
  solve();
  return 0;
}
