output_description: If \\{A_i\\} is pairwise coprime, print `pairwise coprime`; if \\{A_i\\} is
  setwise coprime, print `setwise coprime`; if neither, print `not coprime`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 \ldots A_N
attempt: N = int(input())
  Alist = list(map(int,input().split()))
  # import time
  # import random
  # Alist = [random.randint(1,1000000) for i in range(1000000)]
  # tt = time.time()
  def GCD(a,b):
      if a>b:
          a = a%b
          if a == 0:
              return(b)
          else:
              return GCD(a,b)
      else:
          b = b%a
          if b == 0:
              return(a)
          else:
              return GCD(a,b)
  
  isPC = True
  isSC = False
  kouyaku = 1
  skipindex = 0
  prod = 1
  
  for i,x in enumerate(Alist[1:]):
      prod*=Alist[i-1]
      if GCD(x,prod)>1:
          isPC = False
          kouyaku = GCD(x,prod)
          break
  
  if kouyaku > 1:
      for x in Alist:
          kouyaku = GCD(x,kouyaku)
          if kouyaku == 1:
              isSC = True
              break
  
  if isPC:
      print('pairwise coprime')
  elif isSC:
      print('setwise coprime')
  else:
      print('not coprime')
  # print(time.time() - tt)
problem_description: Statement
  
  We have N integers. The i-th number is A_i.
  
  \\{A_i\\} is said to be pairwise coprime when GCD(A_i,A_j)=1 holds for every
  pair (i, j) such that 1\leq i < j \leq N.
  
  \\{A_i\\} is said to be setwise coprime when \\{A_i\\} is not pairwise coprime
  but GCD(A_1,\ldots,A_N)=1.
  
  Determine if \\{A_i\\} is pairwise coprime, setwise coprime, or neither.
  
  Here, GCD(\ldots) denotes greatest common divisor.
samples: [{"input": "3\n    3 4 5", "output": "pairwise coprime\n    \n\nGCD(3,4)=GCD(3,5)=GCD(4,5)=1, so they are pairwise coprime.\n\n* * *"}, {"input": "3\n    6 10 15", "output": "setwise coprime\n    \n\nSince GCD(6,10)=2, they are not pairwise coprime. However, since\nGCD(6,10,15)=1, they are setwise coprime.\n\n* * *"}, {"input": "3\n    6 10 16", "output": "not coprime\n    \n\nGCD(6,10,16)=2, so they are neither pairwise coprime nor setwise coprime."}]