#include <bits/stdc++.h>
int swap(int &a, int &b) {
  int t;
  t = a;
  a = b;
  b = t;
  return 0;
}
int qsort(int *a, int l, int r) {
  int i = l, j = r, x = a[(l + r) >> 1];
  do {
    while (a[i] < x) i++;
    while (a[j] > x) j--;
    if (i <= j) {
      swap(a[i], a[j]);
      i++;
      j--;
    }
  } while (i <= j);
  if (l < j) qsort(a, l, j);
  if (i < r) qsort(a, i, r);
  return 0;
}
int min(int a, int b) {
  if (a <= b)
    return a;
  else
    return b;
}
int main() {
  int n;
  while (scanf("%d", &n) != EOF) {
    int a[100005] = {0};
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    qsort(a, 1, n);
    for (int i = 1; i <= n; i++) {
      if (a[i] >= i)
        a[i] = min(a[i - 1] + 1, i);
      else if (a[i] < i)
        a[i] = min(a[i], a[i - 1] + 1);
    }
    printf("%d\n", a[n] + 1);
  }
  return 0;
}
