m = int(input())

if m == 1:
    print(1, 1)
    exit()

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

    divisors.sort()
    return divisors

d = make_divisors(m)
if len(d) == 2:
    print(1, m)
else:
    print(d[1], m//d[1])