def prime_decomposition(a)
  division = 1
  primes = {}
  while a > 1
    division += 1
    next if a % division != 0

    while a % division == 0
      if primes[division.to_s]
      	primes[division.to_s] += 1
      else
        primes[division.to_s] = 1
      end
      a /= division
    end
  end
  primes
end

def get_lcm(a, b)
  a_prime = prime_decomposition(a)
  b_prime = prime_decomposition(b)
  lcm = 1

  [a_prime.keys, b_prime.keys].flatten.uniq.each do |key|
    if a_prime[key] && b_prime[key]
      lcm *= key.to_i ** [a_prime[key], b_prime[key]].max
    elsif a_prime[key]
      lcm *= key.to_i ** a_prime[key]
    else
      lcm *= key.to_i ** b_prime[key]
    end
  end
  lcm
end

a, b = gets.split("\s").map(&:to_i)
print get_lcm(a, b)
  