#
#https://www.geeksforgeeks.org/
#     python-program-to-find-the-gcd-of-two-numbers/


# Python code to demonstrate naive
# method to compute gcd ( recursion )
 
 
def hcf(a, b):
    if(b == 0):
        return a
    else:
        print("\na = ", a, "b = ", b, "a%b = ", a%b)
        return hcf(b, a % b)
 
a = 60
b = 48
 
# prints 12
print("The gcd of 60 and 48 is : ", end="")
print(hcf(60, 48))