Problem:
Score : 500 points

Problem Statement

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 setwise coprime when \{A_i\} is not pairwise coprime but GCD(A_1,\ldots,A_N)=1.

Determine if \{A_i\} is pairwise coprime, setwise coprime, or neither.

Here, GCD(\ldots) denotes greatest common divisor.

Constraints

2 \leq N \leq 10^6

1 \leq A_i\leq 10^6

Input

Input is given from Standard Input in the following format:

N
A_1 \ldots A_N

Output

If \{A_i\} is pairwise coprime, print pairwise coprime; if \{A_i\} is setwise coprime, print setwise coprime; if neither, print not coprime.

Sample Input 1

3
3 4 5

Sample Output 1

pairwise coprime

GCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.

Sample Input 2

3
6 10 15

Sample Output 2

setwise coprime

Since GCD(6,10)=2, they are not pairwise coprime. However, since GCD(6,10,15)=1, they are setwise coprime.

Sample Input 3

3
6 10 16

Sample Output 3

not coprime

GCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime.

Solution in JavaScript (Node.js 12.16.1) (judge verdict: Wrong Answer)

const SieveOfEratosthenes = (n) => {
    let flg = (new Array(n)).fill(0)/* set flg[i] to true when it is seived */
    let primes = []/* list of prime numbers */
    for(let i=2; i*i<=n; i++) {
        if(!flg[i]) {
            primes.push(i)
            for(let j=i; j*j<=n; j+=i) {
                flg[j] = 1
            }
        }
    }
    return primes
}

const factorizationBySoE = (n, primes) => {
    //const primes = SieveOfEratosthenes(n)
    let factors = {}
    primes.some(p => {
        if(n < p) return true
        while(n%p===0) {
            if(!factors[p])factors[p]=1
            else factors[p]++
            n/=p
        }
    })
    if(n>1)factors[n]=1
    return factors
}


const getGCD = (a,b) => {
    if(b===0)return a
    else if(a===0)return b
    return getGCD(b, a%b)
}

const main = (arg) => {
    const N = Number(arg.split("\n")[0])
    const a = arg.split("\n")[1].split(" ").map(Number)
    const MAX_A = 10**6 + 5
    
    //  check if p is in {a} (paircoprime)
    // const primes = SieveOfEratosthenes(MAX_A)
    let set = [...new Array(MAX_A)].fill(0)
    isPairCoprime = true
    // for(let i=0; i<N; i++) {
    //     const factors = Object.keys(factorizationBySoE(a[i], primes))
    //     for(let j=0; j<factors.length; j++ ) {
    //         // console.log(`i=${i}, j=${j}, ${factors[j]}`)
    //         // console.log(factors)
    //         if(set[factors[j]] === 1) {
    //             isPairCoprime = false
    //         }
    //         set[factors[j]] = 1
    //     }
    // }
    for(let i=0; i<MAX_A; i++) {
        set[a[i]] = 1
    }
    // console.log(a)
    // console.log(set)

    for(let i=2; i<MAX_A; i++) {
        let cnt=0
        for(let j=i; j<MAX_A; j+=i) {
            cnt+=set[j]
        }
        if(cnt>1) {
            isPairCoprime = false
        }
    }
    
    if(isPairCoprime) {
        console.log("pairwise coprime")
        return
    }
  return
    
    // setcoprime
    // let gcd = getGCD(a[0], a[1])
    let gcd = 0
    for(let i=0; i<a.length; i++) {
        //gcd = getGCD(gcd, a[i])
        // console.log(gcd)
    }
    
    if(gcd===1) {
        console.log("setwise coprime")
        return
    }
    
    console.log("not coprime")
}

main(require("fs").readFileSync("/dev/stdin", "utf8"));