input: Write a function to find the GCD of two numbers using the Euclidean algorithm. If the input numbers are 1000 and 500, the function should print "GCD of number is: 500".
  def findGCD(a, b): 
     if (b == 0): 
         return a
     return findGCD(b, a % b)
      
  a = 1000
  b = 500
  assert findGCD(a, b) == 500
output: def findGCD(a, b): 
     if (b == 0): 
         print("GCD of number is:", a)
         return a
     return findGCD(b, a % b)