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.*;

public class Main
{
	public static void main(String[] args)
	{
		Scanner s=new Scanner(System.in);
		
		long a=s.nextLong();
		long a_c=a;
		long b=s.nextLong();
		long b_c=b;
		long ans=1;
		long x=1;
		
		for(int i=2;a>i && b>i;i++)
		{
			while((a_c%i)==0 && (b_c%i)==0)
			{
				a_c/=i;
				b_c/=i;
				x*=i;
			}
		}
		ans=a_c*b_c*x;
		System.out.println(ans);
		
		s.close();
	}
}
