import sys
from math import gcd
from functools import reduce

input = sys.stdin.readline

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 == [] and n != 1:
        arr.append([n, 1])

    return arr


n = int(input())
a = list(map(int, input().split()))
a.sort()

ds = [0] * (10 ** 6 + 1)

for ai in a:
    for d, _ in factorization(ai):
        ds[d] += 1

if max(ds[2:]) == 1:
    ans = "pairwise coprime"
elif reduce(gcd, a) == 1:
    ans = "setwise coprime"
else:
    ans = "not coprime"
print(ans)