Python GCD Recursive Function

# Write a Python Program to find GCD
# of two numbers using Recursion

# define a recursive GCD function
def recursive_gcd(a,b):
    if(b==0):
        return a
    else:
        return recursive_gcd(b,a%b)

# main
# input two integer numbers
a=int(input("Enter first number:"))
b=int(input("Enter second number:"))

# call recursive function
gcd=recursive_gcd(a,b)

# print GCD
print("GCD is: ", gcd)