# aとbの最大公約数
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


# aとbの最小公倍数
def lcm(a, b):
    g = gcd(a, b)
    return a // g * b


def main():
    a, b = map(int, input().split())
    s, p = a + b, a * b
    print(gcd(s, p))


if __name__ == '__main__':
    main()