import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

#約数列挙
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    return divisors

#n = ni()
#a = na()
n = 1000000
a = range(1000000)
wa = set()
seki = set()
s = 0

for i in a:
    ii = set(make_divisors(i)[1:])
    s += len(ii)
    wa = wa | ii
    seki = seki & ii
    if len(seki) == 0:
        print('not coprime')
        exit()

if len(wa) == s:
    print('pairwise coprime')
elif len(seki) > 0:
    print('setwise coprime')
else:
    print('not coprime')