import sys

INF = 1 << 60

MOD = 10**9 + 7 # 998244353

sys.setrecursionlimit(2147483647)

input = lambda:sys.stdin.readline().rstrip()



# https://qiita.com/Kiri8128/items/eca965fe86ea5f4cbb98

def isPrimeMR(n):

    d = n - 1

    d = d // (d & -d)

    L = [2]

    for a in L:

        t = d

        y = pow(a, t, n)

        if y == 1: continue

        while y != n - 1:

            y = (y * y) % n

            if y == 1 or t == n - 1: return 0

            t <<= 1

    return 1

def findFactorRho(n):

    m = 1 << n.bit_length() // 8

    for c in range(1, 99):

        f = lambda x: (x * x + c) % n

        y, r, q, g = 2, 1, 1, 1

        while g == 1:

            x = y

            for i in range(r):

                y = f(y)

            k = 0

            while k < r and g == 1:

                ys = y

                for i in range(min(m, r - k)):

                    y = f(y)

                    q = q * abs(x - y) % n

                g = gcd(q, n)

                k += m

            r <<= 1

        if g == n:

            g = 1

            while g == 1:

                ys = f(ys)

                g = gcd(abs(x - ys), n)

        if g < n:

            if isPrimeMR(g): return g

            elif isPrimeMR(n // g): return n // g

            return findFactorRho(g)

def primeFactor(n):

    i = 2

    ret = {}

    rhoFlg = 0

    while i*i <= n:

        k = 0

        while n % i == 0:

            n //= i

            k += 1

        if k: ret[i] = k

        i += 1 + i % 2

        if i == 101 and n >= 2 ** 20:

            while n > 1:

                if isPrimeMR(n):

                    ret[n], n = 1, 1

                else:

                    rhoFlg = 1

                    j = findFactorRho(n)

                    k = 0

                    while n % j == 0:

                        n //= j

                        k += 1

                    ret[j] = k



    if n > 1: ret[n] = 1

    if rhoFlg: ret = {x: ret[x] for x in sorted(ret)}

    return ret



from math import gcd

from functools import reduce

def resolve():

    n = int(eval(input()))

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



    if reduce(gcd, A) != 1:

        print("not coprime")

        return



    used = set()

    for a in A:

        for p in primeFactor(a):

            if p in used:

                print("setwise coprime")

                return

            used.add(p)



    print("pairwise coprime")

resolve()
import sys

INF = 1 << 60

MOD = 10**9 + 7 # 998244353

sys.setrecursionlimit(2147483647)

input = lambda:sys.stdin.readline().rstrip()

from functools import reduce

from math import gcd

def resolve():

    n = int(eval(input()))

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



    if reduce(gcd, A) != 1:

        print("not coprime")

        return



    M = max(A)

    sieve = list(range(M + 1))

    sieve[0] = sieve[1] = INF

    for p in range(2, M + 1):

        if sieve[p] != p:

            continue

        for i in range(2 * p, M + 1, p):

            sieve[i] = min(sieve[i], p)



    used = set()

    for a in A:

        primes = set()

        while a > 1:

            p = sieve[a]

            primes.add(p)

            a //= p

        for p in primes:

            if p in used:

                print("setwise coprime")

                return

            used.add(p)



    print("pairwise coprime")

resolve()
import sys

INF = 1 << 60
MOD = 10**9 + 7  # 998244353
sys.setrecursionlimit(2147483647)
input = lambda: sys.stdin.readline().rstrip()
# https://qiita.com/Kiri8128/items/eca965fe86ea5f4cbb98
def isPrimeMR(n):
    d = n - 1
    d = d // (d & -d)
    L = [2]
    for a in L:
        t = d
        y = pow(a, t, n)
        if y == 1:
            continue
        while y != n - 1:
            y = (y * y) % n
            if y == 1 or t == n - 1:
                return 0
            t <<= 1
    return 1


def findFactorRho(n):
    m = 1 << n.bit_length() // 8
    for c in range(1, 99):
        f = lambda x: (x * x + c) % n
        y, r, q, g = 2, 1, 1, 1
        while g == 1:
            x = y
            for i in range(r):
                y = f(y)
            k = 0
            while k < r and g == 1:
                ys = y
                for i in range(min(m, r - k)):
                    y = f(y)
                    q = q * abs(x - y) % n
                g = gcd(q, n)
                k += m
            r <<= 1
        if g == n:
            g = 1
            while g == 1:
                ys = f(ys)
                g = gcd(abs(x - ys), n)
        if g < n:
            if isPrimeMR(g):
                return g
            elif isPrimeMR(n // g):
                return n // g
            return findFactorRho(g)


def primeFactor(n):
    i = 2
    ret = {}
    rhoFlg = 0
    while i * i <= n:
        k = 0
        while n % i == 0:
            n //= i
            k += 1
        if k:
            ret[i] = k
        i += 1 + i % 2
        if i == 101 and n >= 2**20:
            while n > 1:
                if isPrimeMR(n):
                    ret[n], n = 1, 1
                else:
                    rhoFlg = 1
                    j = findFactorRho(n)
                    k = 0
                    while n % j == 0:
                        n //= j
                        k += 1
                    ret[j] = k
    if n > 1:
        ret[n] = 1
    if rhoFlg:
        ret = {x: ret[x] for x in sorted(ret)}
    return ret


from math import gcd
from functools import reduce


def resolve():
    n = int(eval(input()))
    A = list(map(int, input().split()))
    if reduce(gcd, A) != 1:
        print("not coprime")
        return
    used = set()
    for a in A:
        for p in primeFactor(a):
            if p in used:
                print("setwise coprime")
                return
            used.add(p)
    print("pairwise coprime")


resolve()

import sys

INF = 1 << 60
MOD = 10**9 + 7  # 998244353
sys.setrecursionlimit(2147483647)
input = lambda: sys.stdin.readline().rstrip()
from functools import reduce
from math import gcd


def resolve():
    n = int(eval(input()))
    A = list(map(int, input().split()))
    if reduce(gcd, A) != 1:
        print("not coprime")
        return
    M = max(A)
    sieve = list(range(M + 1))
    sieve[0] = sieve[1] = INF
    for p in range(2, M + 1):
        if sieve[p] != p:
            continue
        for i in range(2 * p, M + 1, p):
            sieve[i] = min(sieve[i], p)
    used = set()
    for a in A:
        primes = set()
        while a > 1:
            p = sieve[a]
            primes.add(p)
            a //= p
        for p in primes:
            if p in used:
                print("setwise coprime")
                return
            used.add(p)
    print("pairwise coprime")


resolve()

-# https://qiita.com/Kiri8128/items/eca965fe86ea5f4cbb98 -def isPrimeMR(n): -    d = n - 1 -    d = d // (d & -d) -    L = [2] -    for a in L: -        t = d -        y = pow(a, t, n) -        if y == 1: -            continue -        while y != n - 1: -            y = (y * y) % n -            if y == 1 or t == n - 1: -                return 0 -            t <<= 1 -    return 1 - - -def findFactorRho(n): -    m = 1 << n.bit_length() // 8 -    for c in range(1, 99): -        f = lambda x: (x * x + c) % n -        y, r, q, g = 2, 1, 1, 1 -        while g == 1: -            x = y -            for i in range(r): -                y = f(y) -            k = 0 -            while k < r and g == 1: -                ys = y -                for i in range(min(m, r - k)): -                    y = f(y) -                    q = q * abs(x - y) % n -                g = gcd(q, n) -                k += m -            r <<= 1 -        if g == n: -            g = 1 -            while g == 1: -                ys = f(ys) -                g = gcd(abs(x - ys), n) -        if g < n: -            if isPrimeMR(g): -                return g -            elif isPrimeMR(n // g): -                return n // g -            return findFactorRho(g) - - -def primeFactor(n): -    i = 2 -    ret = {} -    rhoFlg = 0 -    while i * i <= n: -        k = 0 -        while n % i == 0: -            n //= i -            k += 1 -        if k: -            ret[i] = k -        i += 1 + i % 2 -        if i == 101 and n >= 2**20: -            while n > 1: -                if isPrimeMR(n): -                    ret[n], n = 1, 1 -                else: -                    rhoFlg = 1 -                    j = findFactorRho(n) -                    k = 0 -                    while n % j == 0: -                        n //= j -                        k += 1 -                    ret[j] = k -    if n > 1: -        ret[n] = 1 -    if rhoFlg: -        ret = {x: ret[x] for x in sorted(ret)} -    return ret - - +from functools import reduce -from functools import reduce +    M = max(A) +    sieve = list(range(M + 1)) +    sieve[0] = sieve[1] = INF +    for p in range(2, M + 1): +        if sieve[p] != p: +            continue +        for i in range(2 * p, M + 1, p): +            sieve[i] = min(sieve[i], p) -        for p in primeFactor(a): +        primes = set() +        while a > 1: +            p = sieve[a] +            primes.add(p) +            a //= p +        for p in primes: