#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

ll M=1E12+;

const ll N=1e6+;

ll arr[N];

ll pos=;

bool mp[N];

ll ans=M;

void dfs(ll a,ll b,ll p){

    ans=min(ans,max(a,b));

    if(p>=pos) return ;

    dfs(a/arr[p],b,p+);

    dfs(a,b/arr[p],p+);

}

int main(){

    ll x;

    cin>>x;

    ll x1=x;

    ll q=sqrt(x);

    for(ll i=;i<=q;i++){

        if(x%i==)arr[pos++]=;

        while(x%i==){

            x/=i;

            arr[pos-]*=i;

        }

    }

    if(x!=) arr[pos++]=x;

    ll a=x1,b=x1;

    dfs(x1,x1,);

    cout<<ans<<" "<<x1/ans<<endl;

    return ;

}