Codeforces Round #613 (Div. 2)C. Fadi and LCM

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?

Input

The first and only line contains an integer XX (1≤X≤10121≤X≤1012).

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.

Examples

input

Copy

2

output

Copy

1 2

input

Copy

6

output

Copy

2 3

input

Copy

4

output

Copy

1 4

input

Copy

1

output

Copy

1 1

题意：给出一个数n,n=lcm(a,b)，找出使得max(a,b)最小的一对儿，并输出。

解析：首先应该从n的因子里面去下手，他的因子想构造出最小公倍数为n,只需要使得a与b互质就行，也就是gcd(a,b)=1，为了优化，只需要从头开始遍历，遍历到sqrt(n)就行了。i一定是小于或等于n/i的。

直接上代码：

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int main(){
	long long n;
	cin>>n;
	long long a=1,b=n;
	long long maxl=n;
	for(long long i=1;i<=sqrt(n);i++){
		if(n%i==0){
			if(__gcd(i,n/i)==1&&maxl>min(i,n/i)){
				maxl=n/i;
				a=i;
				b=n/i;
			}
		}
	}
	cout<<a<<" "<<b<<"\n";
}