import copy
def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]
  
def main():
  n = int(input())
  arr = list(map(int, input().split()))
  prime = primes(max(arr))
  pf = isPair(prime, arr)
  sf = isSet(prime, arr)
  

  if pf and sf:
    print('pairwise coprime')
    exit()
  if not sf:
    print('not coprime')
    exit()
  else:
    print('setwise coprime')
    exit()

def isPair(prime, arr):
  searched = []
  for p in prime:
    for a in arr:
      if a % p == 0:
        if p in searched:
          return False
        searched += [p]
  return True

def isSet(prime, arr):
  searched = []
  for p in prime:
    if arr[0] % p == 0:
      searched.append(p)
      
  for a in arr[1:]:
    if len(searched) == 0:
      return True
    tmp = []
    for s in searched:
      if a % s == 0:
        tmp.append(s)
        
    searched = tmp
  if len(searched) == 0:
      return True
  return False
  
  
main()