import math, sequtils, strutils


proc divisors(n: int): seq[int] =
  let
    fn1 = proc (i: int): seq[int] =
      if i ^ 2 == n: @[i]
      elif n mod i == 0: @[i, n div i]
      else: @[]
    rootN = n.float.sqrt.int
  (1..rootN).toSeq.map(fn1).foldl(a & b)


let
  m = parseInt stdin.readLine
  list = divisors(m)

echo:
  if list.len == 2:
    "1 " & $m
  else:
    list[2..3].join " "