#P1285C. Fadi and LCM

    ID: 1884 Type: RemoteJudge 1000ms 256MiB Tried: 0 Accepted: 0 Difficulty: (None) Uploaded By: Tags>brute forcemathnumber theory*1400

Fadi and LCM

No submission language available for this problem.

Description

Today, Osama gave Fadi an integer XX, and Fadi was wondering about the minimum possible value of max(a,b)max(a, b) such that LCM(a,b)LCM(a, b) equals XX. Both aa and bb should be positive integers.

LCM(a,b)LCM(a, b) is the smallest positive integer that is divisible by both aa and bb. For example, LCM(6,8)=24LCM(6, 8) = 24, LCM(4,12)=12LCM(4, 12) = 12, LCM(2,3)=6LCM(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 XX (1X10121 \le X \le 10^{12}).

Print two positive integers, aa and bb, such that the value of max(a,b)max(a, b) is minimum possible and LCM(a,b)LCM(a, b) equals XX. If there are several possible such pairs, you can print any.

Input

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

Output

Print two positive integers, aa and bb, such that the value of max(a,b)max(a, b) is minimum possible and LCM(a,b)LCM(a, b) equals XX. If there are several possible such pairs, you can print any.

Samples

Sample Input 1

2

Sample Output 1

1 2

Sample Input 2

6

Sample Output 2

2 3

Sample Input 3

4

Sample Output 3

1 4

Sample Input 4

1

Sample Output 4

1 1