#include <bits/stdc++.h>
bool prime[5 * 100005];
void sieve(int64_t n) {
  for (int64_t p = 2; p * p <= n; p++)
    if (prime[p] == true)
      for (int64_t i = p * p; i <= n; i += p) prime[i] = false;
  prime[1] = false;
}
using namespace std;
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int64_t tt = 1, t, n, m, w, i, j, k, a, b, x, y, ans = 1, sum = 0, cnt = 0;
  while (tt--) {
    int64_t q;
    cin >> n;
    int64_t a[n];
    for (i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    k = 1;
    a[0] = 1;
    for (i = 1; i < n; i++) {
      if (a[i] >= a[i - 1] + 1) {
        a[i] = a[i - 1] + 1;
      }
    }
    cout << a[n - 1] + 1;
  }
  return 0;
}
