import math 

m={}
# A function to print all prime factors of  
# a given number n 

def primeFactors(n): 

      

    # Print the number of two's that divide n 

    while n % 2 == 0: 

        if 2 not in m:
            m[2]=1
        else:
            m[2]+=1

        n = n / 2

          

    # n must be odd at this point 

    # so a skip of 2 ( i = i + 2) can be used 

    for i in range(3,int(math.sqrt(n))+1,2): 

          

        # while i divides n , print i ad divide n 

        while n % i== 0: 

            if i not in m:
                m[i]=1
            else:
                m[i]+=1

            n = n / i 

              

    # Condition if n is a prime 

    # number greater than 2 

    if n > 2: 

        m[n]=1
p=input()
primeFactors(p)

c,d=1,p
g=[]
for k,v in m.items():
    g.append(pow(k,v))
        
v=len(g)
mi=float("inf")
def mik(a,b,i):
    if i==(v-1):
        return min(max(g[i]*a,b),max(a,g[i]*b))
    else:
        return min(mik(g[i]*a,b,i+1),mik(a,g[i]*b,i+1))
if v==0:
    c,d=1,1
else:
    c=mik(1,1,0)
    d/=c
print c,d