def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

import math
N = int(input())
A = list(map(int, input().split()))
ans = A[0]
primes = {x:1 for (x, y) in factorization(A[0])}
flag = True
for i in range(1, N):
    for (p, _) in factorization(A[i]):
        if p not in primes:
            primes[p] = 1
        else:
            primes[p] += 1
    #ans = math.gcd(ans, A[i])
if ans == 1:
    if flag:
        print("pairwise coprime")
    else:
        print("setwise coprime")
else:
    print("not coprime")