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

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

def div(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
    return(q)

def psqr(x):

    sr = math.sqrt(x)
    return ((sr - math.floor(sr)) == 0)

import math

x=int(input())
l=div(x)
l.sort()

d={}
ans=10**9
for i in range(len(l)):
    u=x//l[i]
    if l[i] in d:
        break
    else:
        d[l[i]]=1

    temp=max(l[i],u)
    ans=min(ans,temp)

if(psqr(x)):
    print(x,1)
else:
    print(ans,x//ans)