n = input()
k = 2
primes = [1]
ans = [1, n]
ps = [[1, 1]]
qh, qe = 0, 1
p = []
while k * k <= n:
    if n % k == 0:
        t = 1
        while n % k == 0:
            n /= k
            t *= k
        p.append(t)
    k += 1
if n > 1:
    p.append(n)
for t in p:
    while qh < qe:
        x, y = ps[qh]
        qh += 1
        ps.append([x, y * t])
        ps.append([x * t, y])
        if t == p[-1]:
            for x in ps[-2:]:
                if max(ans) > max(x):
                    ans = x
    qe = len(ps)
print ans[0], ans[1]
