#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, a[N];
int main() {
  while (~scanf("%d", &n)) {
    for (int i = 0; i < n; i++) {
      scanf("%d", a + i);
    }
    sort(a, a + n);
    a[0] = 1;
    for (int i = 1; i < n; i++) {
      a[i] = min(a[i - 1] + 1, a[i]);
    }
    printf("%d\n", a[n - 1] + 1);
  }
  return 0;
}
