Takahashi is organizing a party.

At the party, each guest will receive one or more snack pieces.

Takahashi predicts that the number of guests at this party will be A or B.

Find the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.

We assume that a piece cannot be divided and distributed to multiple guests.

Constraints

* 1 \leq A, B \leq 10^5
* A \neq B
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


A B


Output

Print the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.

Examples

Input

2 3


Output

6


Input

123 456


Output

18696


Input

100000 99999


Output

9999900000
import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		long a = Integer.parseInt(sc.next());
		long b= Integer.parseInt(sc.next());
		long r=0,x,tmp;
		x=a*b;
		if(a<b) {
			tmp=a;
			a=b;
			b=tmp;
		}
		r=a%b;
		while(r!=0) {
			a=b;
			b=r;
			r=a%b;
		}
		
		System.out.println(x/b);
	}
}