input: def findGCD(a: int, b: int) -> int:
      """
      Find the Greatest Common Divisor (GCD) using the Euclidean algorithm.
  
      >>> findGCD(1000, 500)
      500
      >>> findGCD(14, 28)
      14
      """
      if b == 0:
          return a
      return findGCD(b, a % b)
output:     if b == 0:
          return a
      return findGCD(b, a % b)