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: from collections import defaultdict as dd
  
  A, B = map(int, input().split())
  
  
  def get_p(n):
      th = round(n**0.5)
      ans = (n, 1)
      for i in range(2, th + 1):
          if n % i == 0:
              ans = (i, n // i)
              break
      return ans
  
  
  def get_yakusu(n):
      flag = 1
      pn_dic = dd(lambda: 0)
      while flag:
          yaku, red = get_p(n)
          if yaku == n:
              pn_dic[str(yaku)] += 1
              flag = 0
          else:
              pn_dic[str(yaku)] += 1
              n = red
      return pn_dic
  
  
  apn_dic = get_yakusu(A)
  apn_dic["1"] += 1
  bpn_dic = get_yakusu(B)
  bpn_dic["1"] += 1
  
  # print("Adic:",apn_dic)
  # print("Bdic:",bpn_dic)
  
  
  kouyaku_dic = dd(lambda: 0)
  
  wa_key = list(set(apn_dic.keys()) & set(bpn_dic.keys()))
  
  for key in wa_key:
      kouyaku_dic[key] = min(apn_dic[key], bpn_dic[key])
  
  # print("kouyaku:",kouyaku_dic)
  
  m = len(wa_key)
  
  print(m)
  
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."}]