{"raw_statement":[{"iden":"problem statement","content":"Given is an integer sequence $A$: $A_1, A_2, A_3, \\dots, A_N$.  \nLet the _GCD-ness_ of a positive integer $k$ be the number of elements among $A_1, A_2, A_3, \\dots, A_N$ that are divisible by $k$.  \nAmong the integers greater than or equal to $2$, find the integer with the greatest GCD-ness. If there are multiple such integers, you may print any of them."},{"iden":"constraints","content":"*   $1 \\le N \\le 100$\n*   $2 \\le A_i \\le 1000$\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 \\hspace{7pt} A_2 \\hspace{7pt} A_3 \\hspace{5pt} \\dots \\hspace{5pt} A_N$"},{"iden":"sample input 1","content":"3\n3 12 7"},{"iden":"sample output 1","content":"3\n\nAmong $3$, $12$, and $7$, two of them - $3$ and $12$ - are divisible by $3$, so the GCD-ness of $3$ is $2$.  \nNo integer greater than or equal to $2$ has greater GCD-ness, so $3$ is a correct answer."},{"iden":"sample input 2","content":"5\n8 9 18 90 72"},{"iden":"sample output 2","content":"9\n\nIn this case, the GCD-ness of $9$ is $4$.  \n$2$ and $3$ also have the GCD-ness of $4$, so you may also print $2$ or $3$."},{"iden":"sample input 3","content":"5\n1000 1000 1000 1000 1000"},{"iden":"sample output 3","content":"1000"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}