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

M = int(input())
if M == 1:
    exit(print(1, 1))
data = prime_factorize(M)

if len(data) == 1:
    print(1, M)
else:
    print(data[0], M//data[0])