from collections import defaultdict


def main():  
    def factorization(num):
        result = []
        temp = num
        for i in range(2, int(num ** 0.5) + 1):
            if temp % i == 0:
                while temp % i == 0:
                    temp /= i
                d[i] += 1
                result.append(i)
        if temp != 1:
            d[int(temp)] += 1
            result.append(int(temp))
        if result == []:
            d[num] += 1

        return 0
    n = int(input())
    A = map(int, input().split())
    d = defaultdict(int)
    for a in A:
        factorization(a)
    d[1] = 0
    m = max(d.values())
    if m == n:
        print('not coprime')
    elif m >= 2:
        print('setwise coprime')
    else:
        print('pairwise coprime')
    



if __name__ == '__main__':
    main()

