Problem: 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

Solution (in PYTHON3):

Solution:
import math
n=int(input())
if n==1:
    print('1 1')
elif n==2:
    print('1 2')
elif n==3:
    print('1 3')
elif n==4:
    print('1 4')
elif n==5:
    print('1 5')
else:
    m=n+1
    t1=0
    t2=0
    for j in range(1,math.ceil(math.sqrt(n))+1):
        if n%j==0:
            n1=n//j
            
            if max(j,n1)<m:
                if math.gcd(j,n1)==1:
                    m=max(n,n1)
                    t1=j
                    t2=n1
    print(t1,t2,end=" ")