{"raw_statement":[{"iden":"problem statement","content":"We have $N$ integers. The $i$\\-th number is $A_i$.\n${A_i}$ is said to be pairwise coprime when $GCD(A_i,A_j)=1$ holds for every pair $(i, j)$ such that $1\\leq i < j \\leq N$.\n${A_i}$ is said to be setwise coprime when ${A_i}$ is not pairwise coprime but $GCD(A_1,\\ldots,A_N)=1$.\nDetermine if ${A_i}$ is pairwise coprime, setwise coprime, or neither.\nHere, $GCD(\\ldots)$ denotes greatest common divisor."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 10^6$\n*   $1 \\leq A_i\\leq 10^6$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $\\ldots$ $A_N$"},{"iden":"sample input 1","content":"3\n3 4 5"},{"iden":"sample output 1","content":"pairwise coprime\n\n$GCD(3,4)=GCD(3,5)=GCD(4,5)=1$, so they are pairwise coprime."},{"iden":"sample input 2","content":"3\n6 10 15"},{"iden":"sample output 2","content":"setwise coprime\n\nSince $GCD(6,10)=2$, they are not pairwise coprime. However, since $GCD(6,10,15)=1$, they are setwise coprime."},{"iden":"sample input 3","content":"3\n6 10 16"},{"iden":"sample output 3","content":"not coprime\n\n$GCD(6,10,16)=2$, so they are neither pairwise coprime nor setwise coprime."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}