import math
(_,), a  = [list(map(int, s.split())) for s in open(0)]

def fast_prime_factorize(num):
    prime_factor_sets = [set() for _ in range(num+1)]
    for i in range(2, int(math.sqrt(num)) + 2):
        if len(prime_factor_sets[i]) == 0:
            for j in range(i, num+1, i):
                prime_factor_sets[j].add(i)
    return prime_factor_sets

prime_factor_sets = fast_prime_factorize(max(a))

g = prime_factor_sets[0].copy()
l = set()
s = 0
for x in a:
    y = prime_factor_sets[x]
    if len(y) == 0 and x != 1:
        y = {x}
    g &= y
    l |= y
    s += len(y)

if len(g) != 0:
    ans = 'not coprime'
elif len(l) != s:
    ans = 'setwise coprime'
else:
    ans = 'pairwise coprime'
print(ans)