primeset = {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, 1009}



def gcd(n,m):

    while n:

        m,n = n,m%n

    return m



N = int(eval(input()))

A = list(map(int,input().split()))



soinsu = set()

a,b = 0,0



def pariwise():

    global primeset,N,A,soinsu,a,b

    for i in range(N):

        a = A[i]

        b = set()

        for j in primeset:

            while a != 1 and a % j == 0:

                a //= j

                b.add(j)

        if a != 1:

            b.add(a)

        for j in b:

            if j in soinsu:

                return False

            soinsu.add(j)

    return True



def setwise():

    global primeset,N,A,soinsu,a,b

    a = A[0]

    for i in range(1,N):

        a = gcd(a,A[i])

    return (a == 1)



if pariwise():

    print('pairwise coprime')

elif setwise():

    print('setwise coprime')

else:

    print('not coprime')

def gcd(n,m):

    while n:

        m,n = n,m%n

    return m



N = int(eval(input()))

A = list(map(int,input().split()))



maxA = max(A)

B = [0]*(maxA+1)

for i in range(2,maxA+1):

    if B[i] == 0:

        B[i] = i

        for j in range(2*i,maxA+1,i):

            B[j] = i



soinsu = set()

a,b = 0,0



def pariwise():

    global N,A,soinsu,a,b

    for i in range(N):

        a = A[i]

        b = set()

        while a != 1:

            b.add(B[a])

            a //= B[a]

        for j in b:

            if j in soinsu:

                return False

            soinsu.add(j)

    return True



def setwise():

    global N,A,soinsu,a,b

    a = A[0]

    for i in range(1,N):

        a = gcd(a,A[i])

    return (a == 1)



if pariwise():

    print('pairwise coprime')

elif setwise():

    print('setwise coprime')

else:

    print('not coprime')

primeset = {
    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,
    1009,
}


def gcd(n, m):
    while n:
        m, n = n, m % n
    return m


N = int(eval(input()))
A = list(map(int, input().split()))
soinsu = set()
a, b = 0, 0


def pariwise():
    global primeset, N, A, soinsu, a, b
    for i in range(N):
        a = A[i]
        b = set()
        for j in primeset:
            while a != 1 and a % j == 0:
                a //= j
                b.add(j)
        if a != 1:
            b.add(a)
        for j in b:
            if j in soinsu:
                return False
            soinsu.add(j)
    return True


def setwise():
    global primeset, N, A, soinsu, a, b
    a = A[0]
    for i in range(1, N):
        a = gcd(a, A[i])
    return a == 1


if pariwise():
    print("pairwise coprime")
elif setwise():
    print("setwise coprime")
else:
    print("not coprime")

def gcd(n, m):
    while n:
        m, n = n, m % n
    return m


N = int(eval(input()))
A = list(map(int, input().split()))
maxA = max(A)
B = [0] * (maxA + 1)
for i in range(2, maxA + 1):
    if B[i] == 0:
        B[i] = i
        for j in range(2 * i, maxA + 1, i):
            B[j] = i
soinsu = set()
a, b = 0, 0


def pariwise():
    global N, A, soinsu, a, b
    for i in range(N):
        a = A[i]
        b = set()
        while a != 1:
            b.add(B[a])
            a //= B[a]
        for j in b:
            if j in soinsu:
                return False
            soinsu.add(j)
    return True


def setwise():
    global N, A, soinsu, a, b
    a = A[0]
    for i in range(1, N):
        a = gcd(a, A[i])
    return a == 1


if pariwise():
    print("pairwise coprime")
elif setwise():
    print("setwise coprime")
else:
    print("not coprime")

-primeset = { -    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, -    1009, -} - - +maxA = max(A) +B = [0] * (maxA + 1) +for i in range(2, maxA + 1): +    if B[i] == 0: +        B[i] = i +        for j in range(2 * i, maxA + 1, i): +            B[j] = i -    global primeset, N, A, soinsu, a, b +    global N, A, soinsu, a, b -        for j in primeset: -            while a != 1 and a % j == 0: -                a //= j -                b.add(j) -        if a != 1: -            b.add(a) +        while a != 1: +            b.add(B[a]) +            a //= B[a] -    global primeset, N, A, soinsu, a, b +    global N, A, soinsu, a, b