Today, Osama gave Fadi an integer X, and Fadi was wondering about the minimum possible value of max(a, b) such that LCM(a, b) equals X. Both a and b should be positive integers.

LCM(a, b) is the smallest positive integer that is divisible by both a and b. For example, LCM(6, 8) = 24, LCM(4, 12) = 12, LCM(2, 3) = 6.

Of course, Fadi immediately knew the answer. Can you be just like Fadi and find any such pair?

Input

The first and only line contains an integer X (1 ≤ X ≤ 10^{12}).

Output

Print two positive integers, a and b, such that the value of max(a, b) is minimum possible and LCM(a, b) equals X. If there are several possible such pairs, you can print any.

Examples

Input


2


Output


1 2


Input


6


Output


2 3


Input


4


Output


1 4


Input


1


Output


1 1
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:
    l = []
    for i in range(len(c)//2):
        if (c[i]*c[len(c)-i-1])//math.gcd(c[i],c[len(c)-i-1]) == n:
            l.append([c[len(c)-i-1],c[i]])
    l = sorted(l)
    print(l[0][0],l[0][1])