import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

def factorization(n):
    F = 0
    cnt = 1
    for i in range(2, int(-(-n**0.5//1))+1):
        if n%i==0:
            num[i] += 1
            cnt *= i
            F = 1
        if cnt == n:
            break
    if F == 0:
        num[n] += 1

N = i()
A = l()
num = [0]*(10**6+1)
for i in range(N):
    factorization(A[i])
if max(num) == 1:
    print('pairwise coprime')
elif max(num) == N:
    print('not coprime')
else:
    print('setwise coprime')