fun main(args: Array<String>) {
    val (A, B) = readLine()!!.split(" ").map{it.toLong()}

    println(lcm(A, B))
}

/**
 * Calculate the greatest common divisor of `x` and `y` with Euclidean algorithm
 */
private tailrec fun gcd(x: Long, y: Long): Long = if (y == 0L) x else gcd(y, x % y)

private fun lcm(x: Long, y: Long): Long = x / gcd(x, y) * y
