#include <bits/stdc++.h>
using namespace std;
int a[100100];
int b[100100];
int main() {
  int n;
  while (~scanf("%d", &n)) {
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
    }
    sort(a, a + n);
    int sum = 0;
    memset(b, 0, sizeof(b));
    a[0] = 1;
    b[1] = 1;
    for (int i = 0; i < n - 1; i++) {
      if (a[i + 1] - a[i] > 1) {
        a[i + 1] = a[i] + 1;
      }
      b[a[i + 1]] = 1;
    }
    int ans = -1;
    for (int i = 1; i <= 100001; i++) {
      if (b[i] == 0) {
        ans = i;
        break;
      }
    }
    printf("%d\n", ans);
  }
}
