{"problem":{"name":"Find Takahashi","description":{"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$).   Every two different bridges in the village have different heights. P","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc275_a"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $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.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n$H_1$ $H_2$ $\\ldots$ $H_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc275_a","tags":[],"sample_group":[["3\n50 80 70","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."],["1\n1000000000","1\n\nThe village has only one bridge, so the first bridge is the highest."],["10\n22 75 26 45 72 81 47 29 97 2","9\n\nThe village has ten bridges, and the ninth bridge (with a height of $97$) is the highest."]],"created_at":"2026-03-03 11:01:14"}}