import sys, math

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

N = int(input())
A = list(map(int, sys.stdin.readline().rsplit()))

tmp = A[0]

for a in A[1:]:
    tmp = math.gcd(a, tmp)

if tmp != 1:
    print("not coprime")
else:
    ok = True
    S = set()
    for a in A:
        arr = factorization(a)
        for b, _ in arr:
            if b in S:
                ok = False
                break
            else:
                S.add(b)
        if ok is False:
            break
    if ok:
        print("pairwise coprime")
    else:
        print("setwise coprime")
