#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  priority_queue<int> q, r;
  map<int, bool> p;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    q.push(-a);
  }
  int m = 1;
  while (!q.empty()) {
    int ans = -q.top();
    q.pop();
    if (!p[m] && m <= ans) p[m++];
  }
  cout << m << endl;
  return 0;
}
