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
X = int(input())
sq1 = X**0.5
sq = int(sq1)
u=0
def gcd(x, y):
    while(y): 
        x, y = y, x % y 
    return x
if(X%sq1 == 0):
    sq-=1
if(X==1):
    print(1,1)
elif(X==2):
    print(1,2)
elif(X==3):
    print(1,3)
else:
    while(sq>0):
        if(X%sq == 0):
            q = X//sq
            if((gcd(sq, q) != 1 and sq!=1)):
                sq-=1
                continue
            else:
                print(sq,q)
                break
        sq-=1