def factors(n) :
    q=[]
    i = 1
    while i <= math.sqrt(n):

        if (n % i == 0) :
            if (n / i == i) :
                q.append(i)
            else :
                q.append(i)
                q.append(n//i)
        i = i + 1
    q.sort()
    return(q)

def gcd(a,b):
    if a == 0:
        return b
    return gcd(b % a, a)

def lcm(a,b):
    return (a*b) / gcd(a,b)

import math

x=int(input())
l=factors(x)

vis={}
ans=10**18

for i in range(len(l)):
    u=x//l[i]
    if l[i] in vis:
        break
    else:
        vis[l[i]]=1

    if lcm(l[i],u)==x:
        y=max(l[i],u)
        ans=min(ans,y)

print(ans,x//ans)