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
# This function computes GCD 
def compute_gcd(x, y):

   while(y):
       x, y = y, x % y
   return x

# This function computes LCM
def compute_lcm(x, y):
   lcm = (x*y)//compute_gcd(x,y)
   return lcm

def getFactors(n):
    if n == 1:
        return [1, 1]
    factors = []
    i = 1
    while i <= math.sqrt(n): 
        if (n % i == 0 and n // i != i): 
            factors.append(i)
            factors.append(n//i)
        i = i + 1
    return sorted(factors)

def solve():
    n = int(input())

    arr = getFactors(n)
    l = len(arr) // 2 - 1
    r = len(arr) // 2

    while l >= 0:
        if compute_lcm(arr[l], arr[r]) == n:
            print(arr[l], arr[r])
            return

        l -= 1
        r += 1

solve()