'use strict';
// 最小公倍数を求める式（https://www.w3resource.com/javascript-exercises/javascript-math-exercise-10.phpからの貰い物コード）
function lcm_two_numbers(x, y) {
   if ((typeof x !== 'number') || (typeof y !== 'number')) 
    return false;
  return (!x || !y) ? 0 : Math.abs((x * y) / gcd_two_numbers(x, y));
}

function gcd_two_numbers(x, y) {
  x = Math.abs(x);
  y = Math.abs(y);
  while(y) {
    var t = y;
    y = x % y;
    x = t;
  }
  return x;
}

function main(input) {
  let numArr = input[0].split(" ").map(x => x * 1);
  console.log(lcm_two_numbers(numArr[0],numArr[1]));
}
main(require('fs').readFileSync('/dev/stdin', 'utf8').trim().split("\n"))

  