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
n = int(input())


def primeFactors(n): 
    ans = []
      
    # Print the number of two's that divide n 
    fac = 1
    while n % 2 == 0: 
        n = n // 2
        fac *= 2

    if fac != 1:
        ans.append(fac)
          
    for i in range(3,int(math.sqrt(n))+1,2): 
        fac = 1
          
        while n % i== 0: 
            n = n // i 
            fac *= i

        if fac != 1:
            ans.append(fac)
              
    if n > 2: 
        ans.append(n)
    return ans

def dfs(prod, ind):
    global ma
    if prod > li:
        return
    ma = max(ma, prod)
    if ind == len(ans):
        return
    dfs(prod * ans[ind], ind + 1)
    dfs(prod, ind + 1)

ans = primeFactors(n)

li = math.floor(math.sqrt(n))

ma = 1
dfs(1, 0)

print(ma, n//ma)


    

