#include <bits/stdc++.h>
using namespace std;
long long ar[1000009], c = 0;
void f(int n) {
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    scanf("%lld", &ar[i]);
  }
  sort(ar, ar + n);
  int x = 1;
  for (long long i = 0; i < n; i++) {
    if (ar[i] >= x) x++;
  }
  cout << x << endl;
}
int main() {
  int n;
  while (scanf("%d", &n) != EOF) {
    f(n);
  }
  return 0;
}
