from collections import deque
import sys, copy, itertools,heapq
input = sys.stdin.readline

def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr



nn = int(input())
A = list(map(int,input().split()))
suma = sum(A)
B = factorization(suma)
LISTB = [0]*(len(B))

for i in range(len(B)):
  for j in range(nn):
    if A[j] % B[i][0] == 0:
      LISTB[i] += 1

c = max(LISTB)


print(A)
print(suma)
print(B)
print(LISTB)
print(c)

if c == 1:
  print('pairwise coprime')
elif c== nn:
  print('not coprime')
else:
  print('setwise coprime')