from math import gcd, sqrt, ceil
from functools import reduce
_, *aa = map(int, open(0).read().split())

def factorize(n):
    factors = set()
    if n % 2 == 0:
        factors.add(2)
        n //= 2
    while n % 2 == 0:
        n //= 2
    for i in range(3, ceil(sqrt(n + 1)) + 1):
        if n % i == 0:
            factors.add(i)
            n //= i
        while n % i == 0:
            n //= i
    if n > 2:
        factors.add(n)
    return factors

def main(aa):
    
    pair_co = True
    max_factors = set()
    for a in aa:
        factors = factorize(a)
        new_max_factors = max_factors | factors
        if len(new_max_factors) < len(max_factors) + len(factors):
            pair_co = False
            break
        max_factors = new_max_factors
#     if min_factors:
#         return 'not coprime'
#     elif pair_co
    if pair_co:
        return 'pairwise coprime'
    elif reduce(gcd, aa) == 1:
        return 'setwise coprime'
    else:
        return 'not coprime'
        

print(main(aa))