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 sys
import math
import collections
import bisect
from collections import deque as queue
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_list(): return list(map(int, sys.stdin.readline().strip().split()))
def get_string(): return sys.stdin.readline().strip()
for t in range(1):
    def divisors(n):
        ans = []
        for i in range(1, int(math.sqrt(n) + 1)):

            if (n % i == 0):
                if (n / i == i):
                    ans.append(i)
                else:
                    ans.append(i)
                    ans.append(n//i)
        return ans
    num=int(input())
    div=divisors(num)
    a=10**14
    b=10**14
    for i in div:
        a_temp=i
        b_temp=num//i
        lcm=a_temp*b_temp//math.gcd(a_temp,b_temp)
        if lcm==num:
            if max(a,b)>max(a_temp,b_temp):
                a=a_temp
                b=b_temp
    print(a,b)