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
def gcd(a,b) : 
    if b == 0 : 
        return a
    return gcd(b,a%b)

def lcm(a,b) : 
    return a*b/gcd(a,b)
    
def solve(n) :
    mx = 10**13
    for a in range(1,int(math.sqrt(n))+10) :
        if n % a == 0 :
            if max(a,n//a) < mx and lcm(a,n//a) == n : 
                mx = max(a,n//a)
                A = a
                B = n // a
    print("{} {}".format(A,B))

while True :
    try :
        n = int(input())
        solve(n)
    except EOFError :
        break
