from collections import defaultdict

N = int(input())
A = list(map(int, input().split()))

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_dict = defaultdict(int)

for a in A:
    fct = factorization(a)
    for a, _ in fct:
        f_dict[a] += 1

flag = True

for k, v in f_dict.items():
    if v == N:
        print('not coprime')
        exit()
    if v > 1:
        flag = False

if flag:
    print('pairwise coprime')
else:
    print('setwise coprime')

