CF1285C.Fadi and LCM

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?

今天，Osama 给了 Fadi 一个整数 $X$，Fadi 开始思考：满足 $LCM(a, b) = X$ 的正整数对 $(a, b)$ 中，$max(a, b)$ 的最小可能值是多少？
其中，$a$ 和 $b$ 均为正整数。

$LCM(a, b)$ 表示能同时被 $a$ 和 $b$ 整除的最小正整数。例如，$LCM(6, 8) = 24$，$LCM(4, 12) = 12$，$LCM(2, 3) = 6$。

当然，Fadi 立刻就得出了答案。你能否像 Fadi 一样，找出任意这样的一对 $(a, b)$？

The first and only line contains an integer $X$ ($1 \le X \le 10^{12}$).

第一行且唯一一行包含一个整数 $X$（$1 \le X \le 10^{12}$）。

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.

输出两个正整数 $a$ 和 $b$，使得 $max(a, b)$ 的值尽可能小，且 $LCM(a, b) = X$。如果存在多组满足条件的数对，输出任意一组即可。