output_description: Print the maximum number of divisors that can be chosen to satisfy the
  condition.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B
attempt: if __name__ == "__main__":
      x1, x2 = map(int, input().split())
      if x1 >= x2 > 1:
          x1 = x1 - x2
      elif x1 > 1:
          x2 = x2 - x1
      cf = []
      # print("{}, {}".format(x1, x2))
  
      divisors1 = []
      for i in range(1, int(x1**0.5) + 1):
          if x1 % i == 0:
              divisors1.append(i)
              if i != x1 // i:
                  divisors1.append(x1 // i)
      divisors2 = []
      for i in range(1, int(x2**0.5) + 1):
          if x2 % i == 0:
              divisors2.append(i)
              if i != x2 // i:
                  divisors2.append(x2 // i)
  
      koyakusu = set(divisors1) & set(divisors2)
      koyakusu.remove(1)
      # print(list(koyakusu))
  
      for i in list(koyakusu):
          appendable = True
          for j in cf:
              if i % j == 0:
                  appendable = False
                  break
          if appendable:
              cf.append(i)
      # cfは公約数のリスト
      # このリストの中で互いに素のものだけを残す
      # for i in range(len(cf)):
      #   fractions.gcd()
      # print(cf)
      print(len(cf) + 1)
  
problem_description: Statement
  
  Given are positive integers A and B.
  
  Let us choose some number of positive common divisors of A and B.
  
  Here, any two of the chosen divisors must be coprime.
  
  At most, how many divisors can we choose?
  
  Definition of common divisor
  
  An integer d is said to be a common divisor of integers x and y when d divides
  both x and y.
  
  Definition of being coprime
  
  Integers x and y are said to be coprime when x and y have no positive common
  divisors other than 1.
  
  Definition of dividing
  
  An integer x is said to divide another integer y when there exists an integer
  \alpha such that y = \alpha x.
samples: [{"input": "12 18", "output": "3\n    \n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can\nchoose 1, 2, and 3, which achieve the maximum result.\n\n* * *"}, {"input": "420 660", "output": "4\n    \n\n* * *"}, {"input": "1 2019", "output": "1\n    \n\n1 and 2019 have no positive common divisors other than 1."}]