CF1285C.Fadi and LCM

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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?

输入格式

The first and only line contains an integer $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.

输入输出样例

输入#1
```
2
```
输出#1
```
1 2
```
输入#2
```
6
```
输出#2
```
2 3
```
输入#3
```
4
```
输出#3
```
1 4
```
输入#4
```
1
```
输出#4
```
1 1
```

首页