#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int a[100010];
int main() {
  int n;
  cin >> n;
  int sum = 1;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + 1 + n);
  int max = -1;
  for (int i = 1; i <= n; i++) {
    if (a[i] > a[i - 1]) {
      a[i] = a[i - 1] + 1;
    }
  }
  cout << a[n] + 1 << endl;
  return 0;
}
