#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>

using ll = long long;
using namespace std;

constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + 7;

int main(void) {
	int n;
	cin >> n;
	
	map<int, int> prime_factor;
	for(int i = 2; i < n; ++i) {
		while( n % i == 0 ) {
			prime_factor[i]++;
			n /= i;
		}
	}
	
	if( n != 1 ) prime_factor[n] = 1;
	
	int a = 1;
	int b = 1;
	for(auto& x : prime_factor) {
		if( x.second > 1 ) a *= (int)pow(x.first, x.second / 2);
		if( x.second % 2 == 1 ) b *= x.first;
	}
	
	cout << a << " " << b << endl;
	
	return 0;
}