from collections import Counter
from math import sqrt

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
n = int(input())
c = Counter(prime_factorize(n))
ans = 1
for i in c.most_common():
    ans *= i[0] ** ((i[1] // 2) * 2)
print(int(sqrt(ans)), n // ans)