input: def find_gcd(a: int, b: int) -> int:
      """ Compute the greatest common divisor of two given integers a and b
      >>> find_gcd(3, 5)
      1
      >>> find_gcd(25, 15)
      5
      """
output:     while b != 0:
          a, b = b, a % b
      return a