#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
//priority_queue<int,vector<int>, greater<int> > q2;



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N; cin >> N;
	int l = 2;
	VI so, shi;
	while (l*l <= N) {
		int cnt = 0;
		while (N%l == 0) {
			cnt++;
			N /= l;
		}
		if (cnt > 0) {
			shi.push_back(cnt);
			so.push_back(l);
		}
		l++;
	}
	if (N != 1) {
		shi.push_back(1);
		so.push_back(N);
	}
	int ans1 = 1;
	int ans2 = 1;
	REP(i, so.size()) {
		REP(j, shi[i] / 2)ans1 *= so[i];
		if (shi[i] % 2) {
			ans2 *= so[i];
			//cout << so[i] << endl;
		}
	}


	cout << ans1 << " " << ans2 << endl;

	return 0;
}