#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > adj;
vector<bool> visited;
vector<int> topologicalSort;
int dfs(int node) {
  visited[node] = 1;
  for (int i = 0; i < adj[node].size(); i++) {
    if (!visited[adj[node][i]]) dfs(adj[node][i]);
  }
}
int main() {
  int n;
  cin >> n;
  long long a[100001];
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  if (a[0] > 1) a[0] = 1;
  for (int i = 0; i < n - 1; i++) {
    if (a[i + 1] - a[i] > 1) a[i + 1] = a[i] + 1;
  }
  cout << a[n - 1] + 1;
  return 0;
}
