For this Question: Myra has x red colour balls and y blue colour balls.  She wants to distribute these balls into identical groups without any balls left.  What is the largest number of groups she can make?

Identical groups mean there are equal number of same coloured balls in each group.A single line containing two integers x and y. 

Constraints:
1<=x, y<=10000000Return the largest number of groups that can be made.Sample Input
3 9

Sample Output
3

Explanation:- 
1 red ball and 3 blue ball will be in each group. 

Sample Input:
4 9

Sample Output:
1, I have written this Solution Code: def gcd(a, b):
  result = min(a, b)
   
  while result:
    if a % result == 0 and b % result == 0:
      break
    result -= 1
   
  return result

one,two = map(int,input().split())

print(gcd(one,two)), In this Programming Language: Python, Now tell me if this Code is compilable or not?