from math import gcd
n = int(input())
a = list(map(int, input().split()))

d = {}
g = a[0]

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

f = 1

for ai in a:
    g = gcd(g, ai)
    for n, cnt in factorization(ai):
        if n in d:
            f = 0
            break
        else:
            d[n] = 1

if f:
    print('pairwise coprime')
elif g == 1:
    print('setwise coprime')
else:
    print('not coprime ') 

