N=int(input())
A= list(map(int, input().split()))
a=sorted(A)
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr
b=factorization(a[0])
Max=a[N-1]
S=0
for i in range(len(b)):
    c=[]
    d=Max//b[i][0]+1
    for _ in range (d):
        c.append(b[i][0]*_)
    s=1
    for j in range(len(a)):
        s*=c.count(a[j])
    if s==1:
        S+=1
if S>=1:
    print("not coprime")