#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

map<ll, int> PrimeFactor(ll n){
    map<ll,int> ret;
    for(ll i=2;i*i<=n;i++){
        while(n%i==0){
            ret[i]++;
            n/=i;
        }
    }
    if(n!=1) ret[n]=1;
    return ret;
}

ll Pow(ll A_NUM,ll N_TIMES){
    if(N_TIMES==0) return 1;
    if(N_TIMES%2==0){
        ll TMPPP=Pow(A_NUM,N_TIMES/2);
        return TMPPP*TMPPP;
    }
    return A_NUM*Pow(A_NUM,N_TIMES-1);
}


signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    ll n;cin>>n;
    auto mp=PrimeFactor(n);

    ll a=1,b=1;
    for(auto p:mp){
        if(p.second%2) b*=p.first;
        a*=Pow(p.first, (p.second/2));
    }
    cout<<a<<" "<<b<<endl;
    return 0;
}