#include<iostream>
#include<algorithm>
#include<string>
#include<math.h>
#include<bitset>
#include <vector>
#include<bitset>
#include <iomanip>
#include <map>
#include <set>
#include <stack>
#include <deque>
#include <climits>
#include <queue>
using namespace std;


int main() {
	
	long long N;
	cin >> N;
	long long D = pow(N, 0.5);
	long long answer = N;
	for (int i = 2; i <= D; i++) {
		if (N % (i * i) == 0) {
			answer = min(answer, N / (i * i));
		}
	}
	cout << pow(N/answer,0.5)<<" "<<answer;



	
}