PROGRAMMING:Who didn't show up
I'll give you an array of integers. Please find the smallest positive integer that doesn't appear in it.
###Input format:
The first line contains a positive integer n < = 10000, and the second line contains n integers.
###Output format:
Output the smallest positive integer that does not appear.
###Input sample 1:
Here is a set of inputs. For example:
```in
five
3 4 -7 1 6
```
###Output sample 1:
The corresponding output is given here. For example:
```out
two
```
###Input sample 2:
Here is a set of inputs. For example:
```in
six
11 -12 7 8 9 16
```
###Output sample 2:
The corresponding output is given here. For example:
```out
one
```
answer:If there is no answer, please comment
###Input format:
The first line contains a positive integer n < = 10000, and the second line contains n integers.
###Output format:
Output the smallest positive integer that does not appear.
###Input sample 1:
Here is a set of inputs. For example:
```in
five
3 4 -7 1 6
```
###Output sample 1:
The corresponding output is given here. For example:
```out
two
```
###Input sample 2:
Here is a set of inputs. For example:
```in
six
11 -12 7 8 9 16
```
###Output sample 2:
The corresponding output is given here. For example:
```out
one
```
answer:If there is no answer, please comment