import numpy as np
import sys
from math import gcd

input = sys.stdin.buffer.readline


def primes_np(n):
    is_prime = np.ones(n + 1, dtype=bool)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n ** 0.5) + 1):
        if not is_prime[i]:
            continue
        is_prime[i * 2:n + 1:i] = False
    return np.where(is_prime)[0].tolist()


N = int(input())
A = tuple(map(int, input().split()))
MAX = 10 ** 6


def pairwise(A):
    st = set(A)
    for p in primes_np(MAX):
        ct = 0
        for i in range(p, MAX + 1, p):
            if i in st:
                ct += 1
        if ct > 1:
            return False
    return True


def setwise(A):
    return np.gcd.reduce(A) == 1


if pairwise(A):
    print('pairwise coprime')
elif setwise(A):
    print('setwise coprime')
else:
    print('not coprime')
