{"problem":{"name":"Coprime","description":{"content":"We have $N$ integers. The $i$\\-th number is $A_i$. ${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$. ${A_i}$ is said to be setw","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc177_e"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $2 \\leq N \\leq 10^6$\n*   $1 \\leq A_i\\leq 10^6$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $\\ldots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc177_e","tags":[],"sample_group":[["3\n3 4 5","pairwise coprime\n\n$GCD(3,4)=GCD(3,5)=GCD(4,5)=1$, so they are pairwise coprime."],["3\n6 10 15","setwise coprime\n\nSince $GCD(6,10)=2$, they are not pairwise coprime. However, since $GCD(6,10,15)=1$, they are setwise coprime."],["3\n6 10 16","not coprime\n\n$GCD(6,10,16)=2$, so they are neither pairwise coprime nor setwise coprime."]],"created_at":"2026-03-03 11:01:14"}}