import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int a = sc.nextInt();
		int b = sc.nextInt();

		// aとbの最小公倍数を求める
		long lcm = calcLcm(a, b);
		System.out.println(lcm);

		sc.close();
	}

	static long calcLcm(int a, int b) {
		int max = Math.max(a, b);
		int min = Math.min(a, b);
		long product = 1l * max * min;

		if (min == 0)
			return max;

		int temp;
		while ((temp = max % min) != 0) {
			max = min;
			min = temp;
		}

		return product / min;
	}

}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz