import java.util.Scanner;
public class Main {
	private static long gcd(long m, long n) {
	    if(m < n) return gcd(n, m);
	    if(n == 0) return m;
	    return gcd(n, m % n);
	}
	private static long lcm(long m, long n) {
	    return m * n / gcd(m, n);
	}
	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		int A,B;
		do {
		A = stdIn.nextInt();
		B = stdIn.nextInt();
		}while(A<1||A>100000||B<1||B>100000||A==B);
		
		if(A<B) {
			int t = A;
			A = B;
			B = t;
		}
		long kai = 0;
		int hantei =0;
		/*for(int i=1 ; i<100000 ; i++ ) {
			kai = A*i;
			if(kai%B==0) {
				break;
			}
		}*/
		System.out.println(lcm(A,B));
	}
}

/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