## Algorithm

A. Next Test
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

«Polygon» is a system which allows to create programming tasks in a simple and professional way. When you add a test to the problem, the corresponding form asks you for the test index. As in most cases it is clear which index the next test will have, the system suggests the default value of the index. It is calculated as the smallest positive integer which is not used as an index for some previously added test.

You are to implement this feature. Create a program which determines the default index of the next test, given the indexes of the previously added tests.

Input

The first line contains one integer n (1 ≤ n ≤ 3000) — the amount of previously added tests. The second line contains n distinct integers a1, a2, ..., an (1 ≤ ai ≤ 3000) — indexes of these tests.

Output

Output the required default value for the next test index.

Examples
input
Copy
`31 7 2`
output
Copy
`3`

## Code Examples

### #1 Code Example with C++ Programming

```Code - C++ Programming```

``````#include <stdio.h>

using namespace std;

int main() {
int n;
scanf("%d", &n);

int a[3001];
for(int i = 0; i  <  n; ++i)
scanf("%d", a + i);
sort(a, a + n);

int res = -1;
for(int i = 1; i < n; ++i)
if(a[i] != a[i - 1] + 1) {
res = a[i - 1] + 1;
break;
}

if(a[0] > 1)
res = 1;

if(res == -1)
res = a[n - 1] + 1;

printf("%d\n", res);

return 0;
}``````
Copy The Code &

Input

cmd
3
1 7 2

Output

cmd
3