input: 
  def findGCD(a: int, b: int) -> int:
      """ Function to find the GCD of two numbers using the Euclidean algorithm.
      >>> findGCD(1000, 500)
      500
      >>> findGCD(20, 15)
      5
      """
      if b == 0:
          return a
      return findGCD(b, a % b)
  
output:     if b == 0:
          return a
      return findGCD(b, a % b)