#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate, product # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
import math
import bisect
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入g
#
# インデックス系
# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);
# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);
#
#
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
#mod = 998244353
from sys import stdin
readline = stdin.readline
def readInts():
  return list(map(int,readline().split()))
def readTuples():
    return tuple(map(int,readline().split()))
def I():
  return int(readline())
n = I()
A = readInts()
left = [0] * (n+1)
right = [0] * (n+1)
for i in range(1,n):
    left[i] = gcd(left[i-1], A[i-1])
for i in range(n-2,-1,-1):
    right[i] = gcd(right[i+1], A[i+1])
res = 0
nya = set()
for i in range(n):
    l = left[i]
    r = right[i]
    nya.add(gcd(l,r))
lis = list(nya)
if len(lis) == 1:
    if lis[0] == 1:
        print('pairwise coprime')
    else:
        print('not coprime')
else:
    nya = A[0]
    for i in range(1,len(lis)):
        nya = gcd(nya,A[i])
    if nya == 1:
        print('setwise coprime')
    else:
        print('not coprime')
