import math
from functools import reduce
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
def gcd(*numbers):
  return reduce(math.gcd, numbers)
n=int(input())
a=list(map(int,input().split()))
d={}
flg=0
if gcd(*a)!=1:
  print('not coprime')
elif a.count(1)==n:
  print('pairwise coprime')
else:
  for i in a:
    for j in factorization(i):
      if d.get(j[0],0)==0:
        d[j[0]]=j[1]
      elif flg==0:
        print('setwise coprime')
        flg=1
        break
  if flg==0:
    print('pairwise coprime')