import math
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):
        if not is_prime[i]:
            continue
        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]]
n = int(input())
a = list(map(int, input().split()))
b = a[0]
for i in range(1, n): b = math.gcd(b, a[i])
if b != 1: print("not coprime")
else:
    data = primes(10**6)
    count = [0]*(len(data))
    for i in range(n):
        for j in range(len(data)):
            if a[i]%data[j] == 0: count[j] += 1
    x = 0
    for i in range(1, len(count)):
        x = max(x, count[i])
    print("setwise coprime") if x > 1 else print("pairwise coprime")