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 lcm(p,q):
    min = 1
    max = 1
    if(p<q):
        min=p
        max = q
    else:
        min = q
        max = p
    LCM = max;
    for i in range(1,min+1):
        if( (max*i)%min == 0 ):
            LCM = max*i
            break
    return LCM


x = int(input())

a = 1

for i in range(1,x):
    if(i*i<x):
        a = i
    else:
        break

b = 1
while (a>=1) :
    if(x%a)==0:
        b=int(x/a)
        if(lcm(a,b)==x):
            break
    a = a-1


print(a," ",b)

