import math
from collections import deque
Answer = 'pairwise coprime'
N = int(input())
Alist = list(map(int,input().split()))
sign = math.gcd(Alist[0],Alist[1])
Aset = set()
Bset = set()
def factorization(n):
    arr = set()
    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.add(i)

    if temp!=1:
        arr.add(temp)

    if arr==[]:
        arr.add(n)

    return arr
Alist = deque(Alist)
sig =1
A = Alist.popleft()
An = factorization(A)
Aset = An
Bset = An
for _ in range(len(Alist)):
    A = Alist.popleft()
    An =  factorization(A)
    if Aset & An == set():
        Aset = Aset | An
    else:
        Answer ='setwise coprime'
        sign = math.gcd(A,sign)
        break
    sign = math.gcd(A,sign)
for _ in range(len(Alist)):
    A = Alist.popleft()
    sign = math.gcd(A,sign)
if sign != 1 and Answer == 'setwise coprime':
    Answer = 'not corprime'
print(Answer)
                