# Uses python3
import sys

def lcm_naive(a, b):
    for l in range(1, a*b + 1):
        if l % a == 0 and l % b == 0:
            return l

    return a*b


def gcd_fast(a, b):
    current_gcd = 1

    big = max(a, b)
    small = min(a, b)

    if small == 0:
        return big

    while small != 0:
        big, small = small, big % small

    return big


def lcm_fast(a, b):

    gcd = gcd_fast(a, b)

    # print(a * b / int(gcd))
    # print(int(a * b / gcd))

    return int(a * b // int(gcd))


if __name__ == '__main__':
    input = sys.stdin.read()
    a, b = map(int, input.split())
    print(lcm_fast(a, b))

