import fractions
def primes(n):
    is_prime = [True] * (n+1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5 + 1)):
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n+1) if is_prime[i]]
P = primes(10**6)
N = int(input())
A = list(map(int, input().split()))
b = A[0]
a = 0
c= 1
ans = []
for i in range(1, N):
    b = fractions.gcd(b, A[i])
for i in range(0, N):
    for p in P:
        if A[i] % p == 0:
            if p in ans:
                c = 0
                break
            ans.append(p)
    if c == 0:
        break
    if i == N-1:
        a = 1
        print('pairwise conprime')
if a == 0 and b == 1:
    print('setwise conprime')
elif b > 1:
    print('not conprime')

