{"raw_statement":[{"iden":"problem statement","content":"You are given a sequence of length $N$ consisting of integers: $A=(A_1,\\ldots,A_N)$.\nFind the smallest non-negative integer not in $(A_1,\\ldots,A_N)$."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2000$\n*   $0 \\leq A_i \\leq 2000$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $\\ldots$ $A_N$"},{"iden":"sample input 1","content":"8\n0 3 2 6 2 1 0 0"},{"iden":"sample output 1","content":"4\n\nThe non-negative integers are $0,1,2,3,4,\\ldots$.  \nWe have $0,1,2,3$ in $A$, but not $4$, so the answer is $4$."},{"iden":"sample input 2","content":"3\n2000 2000 2000"},{"iden":"sample output 2","content":"0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}