atcoder#ABC245B. [ABC245B] Mex

[ABC245B] Mex

Score : 200200 points

Problem Statement

You are given a sequence of length NN consisting of integers: A=(A1,,AN)A=(A_1,\ldots,A_N).

Find the smallest non-negative integer not in (A1,,AN)(A_1,\ldots,A_N).

Constraints

  • 1N20001 \leq N \leq 2000
  • 0Ai20000 \leq A_i \leq 2000
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:

NN

A1A_1 \ldots ANA_N

Output

Print the answer.

8
0 3 2 6 2 1 0 0
4

The non-negative integers are 0,1,2,3,4,0,1,2,3,4,\ldots. We have 0,1,2,30,1,2,3 in AA, but not 44, so the answer is 44.

3
2000 2000 2000
0