import math

def sieve(data,num):
    return [x for x in data if (x % num != 0)]

prime=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,
       101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,
       283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,
       419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,
       547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,
       661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,
       811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,
       947,953,967,971,977,983,991,997]

n = int(input())
a = list(map(int, input().split()))
M = max(a)

prime = [i for i in prime if M > i]

# 累積GCD
left = [0] * (n + 1)
right = [0] * (n + 1)
for i in range(n):
    left[i + 1] = (math.gcd(left[i], a[i]))
    right[n - i - 1] = (math.gcd(right[n - i], a[n - 1 - i]))

#print(left,right)
if left[n] != 1 or right[0] != 1:
    print("not coprime")
else:
    count = 0
    b = [i for i in a if i != 1]
    k = len(b)
    for i in prime:
        if len(sieve(b,i)) < k-1:
            count = 1
            break
    if count == 1:
        print("setwise coprime")
    else:
        print("pairwise coprime")
