Fadi and LCM

题意翻译

- 输入一个整数 $X$。 - 输出使 $\max(a,b)$ 最小的任意一组 $a,b$，其中 $\operatorname{lcm}(a,b)=X$。 - $1\le X\le 10^{12}$。

题目描述

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