from collections import Counter
N = int(input())

# 素因数分解
def prime_factorize(n): # O(√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

a = 1
for k, v in Counter(prime_factorize(N)).items():
    a *= k**(v//2)

b = N//(a*a)
print(a, b)