Possible Path HackerRank

a=3
b=3
x=1
y=1

<!--2 1 2 3--> <!--3 3 1 1-->

def gcd(a,b):
if b==0:
return a
else:
return gcd(b,a%b)

m = gcd(a,b)
n = gcd(x,y)

if m==n:
print("Yes")
else:
print("No")