{"raw_statement":[{"iden":"problem statement","content":"There are $N$ bridges in AtCoder Village. The height of the bridge numbered $i$ is $H_i$ ($i$ is an integer between $1$ and $N$).  \nEvery two different bridges in the village have different heights.\nPrint the number representing the highest bridge in the village."},{"iden":"constraints","content":"*   $1\\leq N \\leq 100$\n*   $1\\leq H_i \\leq 10^9$\n*   All $H_i$ are different.\n*   All values in the input are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$\n$H_1$ $H_2$ $\\ldots$ $H_N$"},{"iden":"sample input 1","content":"3\n50 80 70"},{"iden":"sample output 1","content":"2\n\nThe village has three bridges.  \nThe first, second, and third bridges have heights of $50$, $80$, and $70$, respectively, so the second bridge is the highest.  \nThus, $2$ should be printed."},{"iden":"sample input 2","content":"1\n1000000000"},{"iden":"sample output 2","content":"1\n\nThe village has only one bridge, so the first bridge is the highest."},{"iden":"sample input 3","content":"10\n22 75 26 45 72 81 47 29 97 2"},{"iden":"sample output 3","content":"9\n\nThe village has ten bridges, and the ninth bridge (with a height of $97$) is the highest."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}