Equal Decoration Rooms

In this problem, you are given two positive integers (M) and (N). The integer (M) represents the number of bundles in a box, and (N) is the number of decorations in each bundle. Your task is to compute the maximum number of rooms that can each be decorated with the same total number of decorations. Mathematically, the total number of decorations is given by (M \times N).

You need to read the input from standard input (stdin) and write the result to standard output (stdout).

inputFormat

The input consists of a single line containing two integers (M) and (N) separated by a space.

outputFormat

Output a single integer, which is the product of (M) and (N), representing the total number of decorations.## sample

4 6

24