from collections import defaultdict
N=int(input())
A=list(map(int,input().split()))

def prime_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


isPairwise = True
isSetwise = True
dict=defaultdict(lambda:0)

for i in range(N):
    arr = prime_factorization(A[i])
    for j in range(len(arr)):
        prime=arr[j][0]
        if prime!=1:
            dict[prime]+=1

for i in dict.values():
    if i==N:
        isPairwise=False
        isSetwise=False
    elif i>1:
        isPairwise=False
    else:
        pass

if isPairwise:
    print('pairwise coprime')
elif isSetwise:
    print('setwise coprime')
else:
    print('not coprime')
    
