output_description: If Takahashi will reach the place in time, print `Yes`; otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      D T S
attempt: #!/usr/bin/env pypy3
  # N,M = map(int,sys.stdin.readline().split())
  # a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
  # a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
  # a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param
  # s = sys.stdin.readline().rstrip()
  # N = int(sys.stdin.readline())
  # INF = float("inf")
  import math, sys
  
  n = int(sys.stdin.readline())
  a = tuple(map(int, sys.stdin.readline().split()))
  # n = int(input())
  # a = list(map(int,input().split()))
  g = math.gcd(a[0], a[1])
  for i in range(2, n):
      g = math.gcd(g, a[i])
  M = max(a)
  acc = a[0]
  for i in range(n):
      acc = math.gcd(acc, a[i])
  if acc != 1:
      print("not coprime")
      exit()
  
  LIMIT = max(a)
  minPrime = [0] * (LIMIT + 1)
  minPrime[1] = 1
  
  
  def make():
      for i in range(2, LIMIT + 1):
          if minPrime[i] == 0:
              minPrime[i] = i
              # print(i)
              for j in range(i + i, LIMIT + 1, i):
                  # print(i,j)
                  if minPrime[j] == 0:
                      minPrime[j] = i
  
  
  make()
  
  
  def factrial(N):
      ret = []
      while minPrime[N] != N:
          ret.append(minPrime[N])
          N = N // minPrime[N]
      if N != 1:
          ret.append(N)
      return ret
  
  
  judge = set([])
  
  for e in a:
      asf = set(factrial(e))
      if judge & asf != set():
          print("setwise coprime")
          exit()
      # judge |= asf
      judge = judge | asf  # too slow
  print("pairwise coprime")
  
problem_description: Statement
  
  Takahashi is meeting up with Aoki.
  
  They have planned to meet at a place that is D meters away from Takahashi's
  house in T minutes from now.
  
  Takahashi will leave his house now and go straight to the place at a speed of
  S meters per minute.
  
  Will he arrive in time?
samples: [{"input": "1000 15 80", "output": "Yes\n    \n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters\nper minute. They have planned to meet in 15 minutes so he will arrive in time.\n\n* * *"}, {"input": "2000 20 100", "output": "Yes\n    \n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters\nper minute. They have planned to meet in 20 minutes so he will arrive just on\ntime.\n\n* * *"}, {"input": "10000 1 1", "output": "No\n    \n\nHe will be late."}]