input: Write a function to find the GCD of two numbers using Euclidean algorithm.
  assert gcd(18, 54) == 18
  assert gcd(48, 18) == 6
  assert gcd(101, 103) == 1
output: def gcd(a, b):
      while b:
          a, b = b, a % b
      return a