from collections import Counter

def prime_decomposition(n):
    i = 2
    table = [1]
    while i*i <= n:
        while n%i == 0:
            n /= i
            table.append(i)
        i += 1
        
    if n > 1:
        table.append(n)
        
    return table

n = int(input())
l = Counter(prime_decomposition(n))

a = 1
b = 1

for k,v in l.items():
    if v > 1:
        a *= (k**(v//2))
        b *= (k**(v%2))
    else:
        b *= k
        
print(int(a),int(b))