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())
  aa=list(map(int,input().split()))
  a=[x for x in aa if x!=1]
  n=len(a)
  if n<=1:
    print('pairwise coprime')
    exit()
    
  # 素因数分解
  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
  tmp=[i for i,j in factorization(min(a))]
  not_flg=False
  for t in tmp:
    flg=True
    for x in a:
      if x%t==0:
        pass
      else:
        flg=False
        break
    if flg:
      not_flg=flg
      break
  if not_flg:
    print('not coprime')
    exit()
  #if n>78499:
  if n>99999:
    print('setwise coprime')
    exit()
  ary=set(())
  for x in a:
    tmp={i for i,j in factorization(x)}
    for t in tmp:
      if t in ary:
        print('setwise coprime')
        exit()
      else:
        ary.add(t)
  print('pairwise coprime')
  
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."}]