#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <deque>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)


int main(){
    int n;
    cin >> n;
    int now = 1;
    int a = 1,b;
    int ansa,ansb;

    while(now <= n){
        if (n%now == 0){
            ansa = a;
            ansb = n/now;
        }
        now = (a+1)*(a+1);
        a++;
    }
    
    cout << ansa << " " << ansb << endl;
   return 0;

}