import math
from functools import reduce
N = int(input())
A = list(map(int, input().split()))

def gcd_list(numbers):
  return reduce(math.gcd, numbers)

flag = False
for i in range(N-1):
  for j in range(i+1, N):
    if math.gcd(A[i], A[j]) > 1:
      flag = True
      break
  if flag:
    break
if not flag:
  print('pairwise coprime')
else:
  print('not coprime')