import sys
input = sys.stdin.readline
import numpy as np
import itertools

def gcd(a,b):
    if(b>a):
        a,b=b,a
    i=b
    while i>0:
        if(a%i==0 and b%i==0):
            return i
        i-=1

mod = 1000000000+7
n = int(input())
A = [int(a) for a in input().strip().split()]
s = sum(A)%mod
S = 0

for a in A:
    s = s-a
    S += (s*a)%mod
S = (S%mod)%1000001

if S in A:
    print("not coprime")

else:
    c =False
    for (a, b) in itertools.combinations(A,2):
        if gcd(a,b)!=1:
            True
            print("set comprime")
            break
        else:
            pass
    if not c:
        print("pair comprime")
