def find_gcd(m, n):
    while n:
        m, n = n, m % n
    return m

m, n = map(int, input().split())

gcd = find_gcd(m, n)
print(gcd)