def num_comm_div(x,y):
  def ngcd(x,y):
      i=1
      while(i<=x and i<=y):
          if(x%i==0 and y%i == 0):
              gcd=i;
          i+=1
      return gcd;
  
  n = ngcd(x,y)
  result = 0
  z = int(n**0.5)
  i = 1
  while(i <= z):
    if(n % i == 0):
      result += 2 
      if(i == n/i):
        result-=1
    i+=1
  return result
def num_comm_div(x, y):
    def ngcd(x, y):
        VAR_0 = 1
        while VAR_0 <= x and VAR_0 <= y:
            if x % VAR_0 == 0 and y % VAR_0 == 0:
                gcd = VAR_0
            VAR_0 += 1
        return gcd
    n = ngcd(x, y)
   
    result = 0
    z = int(n ** 0.5)
    VAR_0 = 1
    while VAR_0 <= z:
        if n % VAR_0 == 0:
            result += 2
            if VAR_0 == n / VAR_0:
                result -= 1
        VAR_0 += 1
    return result