#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}

vi f(int n){
    vi ret;
    for(int i = 1; i*i <= n; i++)if(n%i == 0){
        ret.push_back(i);
        if(i*i < n)ret.push_back(n/i);
    }
    sort(all(ret));
    return ret;
}

signed main(void) {
    int n;
    cin >> n;
    if(n == 1){
        cout << "1 1" << endl;
        return 0;
    }
    vi v = f(n);
    //rep(i,v.size())cout << " " << v[i];cout << endl;
    cout << v[1] << " " << v[v.size()-2] << endl;
}