import  numpy as np
n=int(input())
a= list(map(int, input().strip().split()))
a.sort()
b=np.gcd(a[0],a[1])
def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
B=prime_factorize(b)
l=len(B)
f=[0]*l
p=[]
for i in range(l):
    for j in range(n):
        if a[j]%B[i]>0:
            f[j]=1
            break
if f.count(0)==0:
    print("pairwise coprime")
else:
  print("not coprime")

