import math


n = int(input())
a = [int(x) for x in input().split()]
l = [[] for i in range(n)]

def gcd(p,q):
    while q != 0:
        p = min(p%q,-(p%q)+q)
        p,q = q,p
    return p


g = a[0]
for i in range(1,n):
    g = gcd(g,a[i])

if g != 1:
    print("not coprime")

else:
    def fur(x):
        k = [1 for i in range(x+1000)]
        k[0]=k[1]=0
        for i in range(2,x+1):
            for j in range(i-1,x//i):
                k[i+j*i] = 0
        return k

    t = fur(10**6)

    cnt = 0

    def soi(x):
        global t,cnt
        for i in range(2,int(math.sqrt(x))+1):
            if x%i==0:
                if t[i] == 1 and t[x//i] == 1:
                    t[i] = 2
                    t[x//i] = 2
                elif t[i] == 2 or t[x//i] == 2:
                    cnt = 1
                    break
    
    for i in range(n):
        if cnt == 1:
            break
        else:
            soi(a[i])
    
    if cnt == 1:
        print("setwise coprime")
    
    else:
        print("pairwise coprime")