Problem:
Greatest Common Divisor

Write a program which finds the greatest common divisor of two natural numbers a and b

Input

a and b are given in a line sparated by a single space.

Output

Output the greatest common divisor of a and b.

Constrants

1 ≤ a, b ≤ 109

Hint

You can use the following observation:

For integers x and y, if x ≥ y, then gcd(x, y) = gcd(y, x%y)

Sample Input 1

54 20

Sample Output 1

2

Sample Input 2

147 105

Sample Output 2

21

Solution in Python3 (judge verdict: Accepted)

x, y = [int(a) for a in input().split()]

def divisor(x, y):
    while x % y != 0:
        amari = x % y
        if amari == 0:
            return y
        x = y
        y = amari
    return y
print(divisor(x, y))