def factorize(n):
    if n == 1: return []
    res = []
    x, y = n, 2
    while y * y <= x:
        while x % y == 0:
            res.append(y)
            x //= y
        y += 1
    if x > 1:
        res.append(x)
    return res

from collections import Counter

N = int(input())
F = factorize(N)
C = Counter(F)

b = 1
a = 1

for k, v in C.items():
    if v % 2 == 1:
        b *= k
    a *= k**(v // 2)

print(a, b)