#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, temp;
  cin >> n;
  vector<int> num;
  while (n != 0) {
    cin >> temp;
    num.push_back(temp);
    n--;
  }
  sort(num.begin(), num.end());
  int smallest = 1;
  for (int i = 0; i < num.size(); i++) {
    if (smallest != num[i]) {
      break;
    }
    smallest++;
  }
  cout << smallest;
  return 0;
}
