from collections import defaultdict

n = int(input())

Prime_cnt = defaultdict(int)
while n % 2 == 0:
    Prime_cnt[2] += 1
    n //= 2

f = 3
while f * f <= n:
    while n % f == 0:
        Prime_cnt[f] += 1
        n //= f
    f += 2
if n != 1:
    Prime_cnt[n] += 1

a, b = 1, 1
for prime, cnt in Prime_cnt.items():
    q, r = divmod(cnt, 2)
    a *= pow(prime, q)
    b *= pow(prime, r)
print(a, b)