import sys
from math import gcd
stdin = sys.stdin
n = int(input())
an = list(map(int, stdin.readline().split()))
m = max(an)
ls = [i for i in range(m+1)]
for i in range(2, m+1):
if ls[i] == i:
for j in range(2, m//i+1):
ls[i*j] = i
def primeset(t):
ls2 = set()
while t != 1:
ls2.add(ls[t])
t = t//ls[t]
return ls2
primes = set()
for i in an:
for j in primeset(i):
if j in primes:
break
else:
primes |= primeset(i)
continue
break
else:
print("pairwise coprime")
exit(0)
GCD = an[0]
for i in range(1, n):
GCD = gcd(GCD, an[i])
if GCD == 1:
print("setwise coprime")
else:
print('not coprime')