{"raw_statement":[{"iden":"problem statement","content":"In a sequence of $N$ positive integers $a = (a_1, a_2, \\dots, a_N)$, how many different integers are there?"},{"iden":"constraints","content":"*   $1 \\leq N \\leq 1000$\n*   $1 \\leq a_i \\leq 10^9 \\, (1 \\leq i \\leq N)$\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":"6\n1 4 1 2 2 1"},{"iden":"sample output 1","content":"3\n\nThere are three different integers: $1, 2, 4$."},{"iden":"sample input 2","content":"1\n1"},{"iden":"sample output 2","content":"1"},{"iden":"sample input 3","content":"11\n3 1 4 1 5 9 2 6 5 3 5"},{"iden":"sample output 3","content":"7"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}