
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())
data = list(map(int, input().split()))
count = {}
for a in data:
    for factor, _ in factorization(a):
        count[factor] = count.get(factor, 0) + 1
pc = True
sc = True
for value in count.values():
    if value != 1:
        pc = False
    if value == n:
        sc = False
if pc is True:
    print("pairwise coprime")
elif sc is True:
    print("setwise coprime")
else:
    print("not coprime")