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
from collections import defaultdict as dd
from math import sqrt,gcd
#l=list(map(int,I().split()))
import sys
input=sys.stdin.readline
I=input
n=int(input())
nn=n
n=int(sqrt(n))
a=nn
b=nn
for i in range(1,n+1):
    if(nn%i==0):
        aa=min(i,nn//i)
        bb=max(i,nn//i)

    if(bb<b and gcd(aa,bb)==1):
        a=aa
        b=bb
print(a,b)
