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