t = int(input())
arr = list(map(int, input().split()))
ans = -1
arr.sort()
for i in range(1, arr[-1], 1):
if i == arr[i-1]:
continue
else:
ans = i
break
if ans == -1:
print(arr[-1] + 1)
else:
print(ans)#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
const long int N=1e6;
map<long long int,bool>vis;
int main()
{
fast;
long long int n;
cin>>n;
vector<long long int>vect(n);
for(long long int i(0);i<n;i++){cin>>vect[i];vis[vect[i]]=1;}
long long int i;
for(i=1;i<=3000;i++){
if(vis[i]==0)break;}
cout<<i<<endl;
return 0;}706B - Interesting drink | 1265A - Beautiful String |
214A - System of Equations | 287A - IQ Test |
1108A - Two distinct points | 1064A - Make a triangle |
1245C - Constanze's Machine | 1005A - Tanya and Stairways |
1663F - In Every Generation | 1108B - Divisors of Two Integers |
1175A - From Hero to Zero | 1141A - Game 23 |
1401B - Ternary Sequence | 598A - Tricky Sum |
519A - A and B and Chess | 725B - Food on the Plane |
154B - Colliders | 127B - Canvas Frames |
107B - Basketball Team | 245A - System Administrator |
698A - Vacations | 1216B - Shooting |
368B - Sereja and Suffixes | 1665C - Tree Infection |
1665D - GCD Guess | 29A - Spit Problem |
1097B - Petr and a Combination Lock | 92A - Chips |
1665B - Array Cloning Technique | 1665A - GCD vs LCM |