#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

const long long INF = 1e17+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);

using namespace std;

int main(){
	int n;
	cin >> n;
	int temp_a=1;
	int ans_a=999999999,ans_b=999999999;
	while(1){
		if(ans_b<=1 || temp_a*temp_a>n){
			break;
		}
		if(n%(temp_a*temp_a)==0){
			ans_b=n/(temp_a*temp_a);
			ans_a=temp_a;
		}
		temp_a++;
	}
	cout << ans_a << " " << ans_b << endl;
	return 0;
}