import math  
  
# method to print the divisors 
def printDivisors(n) : 
    c = []
    # Note that this loop runs till square root 
    i = 1
    while i <= math.sqrt(n): 
          
        if (n % i == 0) : 
              
            # If divisors are equal, print only one 
            if (n / i == i) : 
                c.append(i) 
            else : 
                # Otherwise print both 
                c.append(i)
                c.append(n/i) 
        i = i + 1
    return c
n = int(input())
p = printDivisors(n)
c = sorted(p)
if c == [1]:
    print 1,1,
else:
    if len(c)%2==0:
        print c[len(c)//2],c[len(c)//2-1],
    else:
        print c[len(c)//2],c[len(c)//2+1],