def prime_factorization(n):  # 素因数分解
    res = []
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            cnt = 0
            while n % i == 0:
                cnt += 1
                n //= i
            res.append((i, cnt))
    if n > 1:
        res.append((n, 1))
    return res


N = int(input())
pf = prime_factorization(N)
a = 1
b = 1
for k, v in pf:
    div, mod = divmod(v, 2)
    if div:
        a *= k ** div
    if mod:
        b *= k
print(a, b)