Greatest common divisor

WSQ12

#Gilberto Rogel García wsq12 greates common divisor
def gcd(x,y):
    if(x==y):
        res=x
    elif(x>y):
        res=gcd((x-y),y)
    else:
        res=gcd(x,(y-x))
    return res
    
x=int(input("Give a number:"))
y=int(input("Give me another number:"))
z=gcd(x,y)
print("The greatest common divisor of your numbers is",z)