{"raw_statement":[{"iden":"problem statement","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."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $2 \\leq N \\leq 10^5$\n*   $1 \\leq A_i \\leq 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $...$ $A_N$"},{"iden":"sample input 1","content":"4\n2 10 8 40"},{"iden":"sample output 1","content":"2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be $2$, which is minimum."},{"iden":"sample input 2","content":"4\n5 13 8 1000000000"},{"iden":"sample output 2","content":"1"},{"iden":"sample input 3","content":"3\n1000000000 1000000000 1000000000"},{"iden":"sample output 3","content":"1000000000"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}