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.

Input is given from Standard Input in the following format: >$A$ $B$ #### Constraints - $1 \leq A, B \leq 10^5$ - $A \neq B$ - All values in input are integers.

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.

***For Sample #1:*** When we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.

AtCoder [ABC148C]