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
def function(a,b):
    if (b%a==0):
        return False
    else:
        for i in range(2,a//2+1):
            if ((a%i==0) and (b%i==0)):
                return False
        return True
import math
X=int(input())
if (X==1):
    print("1","1")
else:
    x=int(math.sqrt(X))
    i=x
    k="y"
    while((k=="y") and (i>=2)):
        if (X%i==0):
            y=X//i
            if (i!=y):
                if(function(i,y)):
                    print(i,y)
                    k="n"
        i=i-1
    if (k=="y"):
        print("1",X)