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

d = {}
N = int(input())
A = list(map(int,input().split()))
for ai in A:
	for prime in factorization(ai):
		if prime[0] in d.keys():
			d[prime[0]] += 1
		else:
			d[prime[0]] = 1
if max(d.values()) == N:
	print("not coprime")
elif max(d.values()) == 1:
	print("pairwise coprime")
else:
	print("setwise coprime")