from math import sqrt
def divisors(N:int):
    max = int(sqrt(N)) + 1
    a = [x for x in range(max)]
    a[1] = 0
    for p in a:
        if not p:
            continue
        else:
            for multi in range(p + p,max,p):
                a[multi] = 0
    return [x for x in a if x]

C = int(input())
for A in divisors(C):
    if not C % A:
        break
else:
    A = 1
B = C // A
print("%d %d" % (A,B))