{"problem":{"name":"Monsters Battle Royale","description":{"content":"There are $N$ monsters, numbered $1, 2, ..., N$. Initially, the health of Monster $i$ is $A_i$. Below, a monster with at least $1$ health is called alive. Until there is only one alive monster, the fo","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc118_c"},"statements":[{"statement_type":"Markdown","content":"There are $N$ monsters, numbered $1, 2, ..., N$.\nInitially, the health of Monster $i$ is $A_i$.\nBelow, a monster with at least $1$ health is called alive.\nUntil there is only one alive monster, the following is repeated:\n\n*   A random alive monster attacks another random alive monster.\n*   As a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\n## Constraints\n\n*   All values in input are integers.\n*   $2 \\leq N \\leq 10^5$\n*   $1 \\leq A_i \\leq 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $...$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc118_c","tags":[],"sample_group":[["4\n2 10 8 40","2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be $2$, which is minimum."],["4\n5 13 8 1000000000","1"],["3\n1000000000 1000000000 1000000000","1000000000"]],"created_at":"2026-03-03 11:01:14"}}