import java.util.Scanner

import scala.collection.mutable.{ArrayBuffer, ListBuffer}

object Primes extends Iterable[Long] {
  var checked = 2L
  val xs: ListBuffer[Long] = ListBuffer(2L)

  /**
   * Check if n is prime number.
   *
   * @param n number
   * @return true when n is prime number
   */
  def contains(n: Long): Boolean = xs.takeWhile(_ <= n).contains(n)

  /**
   * Get i-th prime number.
   *
   * @param i index (0-)
   * @return i-th prime number
   */
  def apply(i: Int): Long = {
    while (xs.length <= i) {
      var n = checked + 1
      while (xs.takeWhile(j => j * j <= n).exists(n % _ == 0)) {
        n += 1
      }
      xs.append(n)
      checked = n
    }
    xs(i)
  }

  /**
   * Get iterator.
   *
   * @return iterator
   */
  override def iterator: Iterator[Long] = new Iterator[Long] {
    var i = 0

    override def hasNext: Boolean = true

    override def next(): Long = {
      val x = apply(i);
      i += 1;
      x
    }
  }
}

object Main {
  def main(args: Array[String]) {
    val result = solve(new Scanner(System.in))
    if (result.length > 0) println(result)
  }

  def solve(in: String): String = solve(new Scanner(in))

  def solve(sc: Scanner): String = {
    val A = sc.nextLong
    val B = sc.nextLong

    val ab = ArrayBuffer(1L)
    val primes = Primes.iterator
    var a = A
    var b = B
    var p = primes.next
    do {
      while (a % p == 0 && b % p == 0) {
        ab.append(p)
        a /= p
        b /= p
      }
      p = primes.next
    } while (p < a || p < b)

//    println(ab.mkString(","))
//    println("a=" + a + ", b=" + b)
    (a * b * ab.product).toString
  }
}
