#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
vector<pair<long long, long long> > v;
map<string, int> mp;
bool cmp(pair<long long, long long> p, pair<long long, long long> q) {
  if (p.first > q.first) return (q.second < p.second);
}
long long a[101000];
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, m, cnt = 1, b, ans = 0, ans2, x, y, k;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  cnt = 1;
  for (int i = 1; i <= n; i++)
    if (a[i] >= cnt) cnt++;
  cout << cnt;
}
