import math
from functools import reduce

def gcd_list(numbers):
  return reduce(math.gcd, numbers)
  
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

n=int(input())
a=list(map(int, input().split(" ")))
check = [False for i in range(10 ** 6 + 1)]
pairwise = True
for i in a:
  temp = (factorization(i))
  for j, _ in temp:
    if check[j] == True:
      pairwise = False
      break
    else:
      check[j] = True
  else:
    continue
  break
if pairwise:
  print("pairwise coprime")
else:
  if gcd_list(a) == 1:
    print("setwise coprime")
  else:
    print("not coprime")