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())
  A = list(map(int, input().split()))
  sumA = sum(A) % (1000000007)
  square = 0
  for i in range(N):
      square -= ((A[i] % (1000000007)) ** 2) % (1000000007)
      if square < 0:
          square = square + 1000000007
  res = (((sumA * sumA + square) % (1000000007)) * ((1000000007 + 1) / 2)) % 1000000007
  print(round(res))
  
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."}]