def divisor(N):
  divisors = set()
  for i in range(1, int(N ** 0.5) + 1):
    if N % i == 0:
      divisors.add(i)
      divisors.add(int(N / i))
  return list(sorted(list(divisors)))
def prime(N):
  return len(divisor(N)) == 2
N = int(input())
if N == 1:
  print(1, 1)
else:
  if prime(N):
    print(1, N)
  else:
    K = divisor(N)
    print(K[1], K[-2])