For this Question: Given 2 non-negative integers m and n, find gcd(m, n)
GCD of 2 integers m and n is defined as the greatest integer g such that g is a divisor of both m and n. Both m and n fit in a 32 bit signed integer.

 NOTE: DO NOT USE LIBRARY FUNCTIONSInput contains two space separated integers, m and n

Constraints:-
1 < = m, n < = 10^18Output the single integer denoting the gcd of the above integers.Sample Input:
6 9

Sample Output:
3

Sample Input:-
5 6

Sample Output:-
1, I have written this Solution Code: def hcf(a, b):
	if(b == 0):
		return a
	else:
		return hcf(b, a % b)


li= list(map(int,input().strip().split()))
print(hcf(li[0], li[1])), In this Programming Language: Python, Now tell me if this Code is compilable or not?