MEX#5880

MEX

1 second

128 megabytes

Very easy

A club has $1 0^{5}$ 10^5 members, each assigned a unique number from $0$ to $1 0^{5} - 1$ 10^5 - 1. The smaller the number, the higher the participant's skill in club competitions. However, $n$ members are absent.

Now, the club organizer wants to find the most skilled member who is still present in the club (that is, the member with the smallest number who is not absent).

Input

The first line contains the number of absent members $n$ ( $1 \leq n < 1 0^{5}$ 1 \leq n < 10^5). The second line lists their numbers — all numbers are less than $1 0^{5}$ 10^5.

Output

Print one number — the number of the most skilled present club member.

Examples

Example 1

Editorial