input: from typing import Tuple
  
  
  def findGCD(a: int, b: int) -> int:
      """Compute the Greatest Common Divisor (GCD) of two numbers using the Euclidean algorithm.
      >>> findGCD(56, 98)
      14
      >>> findGCD(1000, 500)
      500
      """
      if b == 0:
          return a
      return findGCD(b, a % b)
output:     if b == 0:
          return a
      return findGCD(b, a % b)