import numpy as np
n=int(input())
a=list(map(int, input().split()))

c=[0]*max(a)

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

for i in range(n):
    tmp = factorization(a[i])
    for k in tmp:
        c[k[0]-1]+=1
    #print(tmp)

#print(c)   
maxcount=max(c)

if np.gcd.reduce(a) != 1:
    print('not coprime')
elif maxcount <= 1:
    print('pairwise coprime')
else:
    print('setwise coprime')