C. Fadi and LCM

LCM"/>

C. 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?

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

Output
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.

Examples
inputCopy
2
outputCopy
1 2
inputCopy
6
outputCopy
2 3
inputCopy
4
outputCopy
1 4
inputCopy
1
outputCopy
1 1

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x,res,ans=0x3f3f3f3f;
ll lcm(ll a,ll b)
{return (a*b)/__gcd(a,b);
}
int main()
{scanf("%lld",&x);for(ll i=1;i<=x/i;i++){if(x%i==0&&lcm(i,x/i)==x){ans=i;}}cout<<ans<<" "<<x/ans<<endl;
}