import java.util.Scanner;

public class LCMCalculator {
    
    // Function to calculate GCD using Euclid’s Algorithm
    public static int gcd(int a, int b) {
        if (b == 0) return a;
        return gcd(b, a % b);
    }

    // Function to calculate LCM
    public static int lcm(int a, int b) {
        return (a * b) / gcd(a, b);
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        try {
            int num1 = Integer.parseInt(sc.nextLine().trim());
            int num2 = Integer.parseInt(sc.nextLine().trim());

            // Validation
            if (num1 <= 0 || num2 <= 0) {
                System.out.println("Invalid input");
            } else {
                System.out.println(lcm(num1, num2));
            }
        } catch (Exception e) {
            System.out.println("Invalid input");
        }
    }
}