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


N = int(input())
A = list(map(int, input().split()))
all_so = []
num2cnt = {}
cnt = 0
for i in range(N):
    so = [one[0] for one in factorization(A[i])]
    flag = False
    for one in so:
        if one not in all_so:
            all_so.append(one)
            flag=True
        if one not in num2cnt:
            num2cnt[one] = 0
        num2cnt[one]+=1
            
    if flag:
        cnt+=1
if cnt==N:
    print('pairwise coprime')
else:
    flag = True
    for key in num2cnt:
        if num2cnt[key]==N:
            print('not coprime')
            flag = False
            break
    if flag:
        print('setwise coprime')