Stepan's Alarm Clocks

Stepan lives in a dormitory and, as a "good" student, he often oversleeps his classes. To help him wake up on time, his parents have given him two alarm clocks. Stepan sets both alarms for the same time because one alarm alone isn't enough to wake him. Anticipating that he might still oversleep, the first alarm clock rings every n minutes, and the second one rings every m minutes. Write a program to determine after how many minutes both alarm clocks will ring simultaneously for the second time.

Input

The input consists of a single line containing two integers n and m (1 ≤ n, m ≤ 2*10^9).

Output

Output a single integer representing the number of minutes after which both alarm clocks will ring simultaneously for the second time.

Examples