//
//  main.cpp
//  No416
//
//  Created by nanophoto on 2016/09/18.
//  Copyright © 2016年 nanophoto. All rights reserved.
//

#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <iostream>
#include <string>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdint>
#include <climits>
#include <unordered_set>

using namespace std;

#define ll long long int
#define ti4 tuple<int,int,int,int>
#define pii pair<int,int>
#define REP(x,n) for(int x = 0;x < n;x++)

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}

int main() {
    ll m;
    cin >> m;
    
    if(m <= 16)
    {
        for(int i = 2;i < m;i++)
        {
            if(m % i == 0)
            {
                cout << i << " " << m / i << endl;
                return 0;
            }
        }
        cout << "1 " << m << endl;
    }
    for(ll i = 2;i < sqrt(m) + 1;i++)
    {
        if(m % i == 0)
        {
            cout << i << " " << m / i << endl;
            return 0;
        }
    }
    cout << "1 " << m << endl;
    return 0;
}