[백준] 13241 최소공배수

a,b = map(int,input().split())
max_num, min_num = max(a,b) , min(a,b)
diff = max_num % min_num

while diff != 0 : # 유클리디안 호제법으로 최소공배수 구하기
    max_num = min_num
    min_num = diff
    diff = max_num % min_num

print(int((a*b)/min_num))