def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return {i:0 for i in range(n + 1) if is_prime[i]}

n = int(input())
a = list(map(int,input().split()))
d = primes(max(a))

for i in a:
    for k , v in d.items():
        if i % k == 0:
            d[k] += 1
flag = True  
for v in d.values():
    if v == n:
        print("not coprime")
        exit()
    elif v > 1:
        flag = False
if flag:
    print("pairwise coprime")
else:
    print("setwise coprime")