M = int(input())

def find_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5) + 1):
        if n % i == 0:
            divisors.append(i)
            if i * i != n:
                divisors.append(n // i)
    divisors.sort()
    return divisors


A = find_divisors(M)

if len(A) < 2:
    print(1, M)
else:
    print(A[1], M//A[1])