#include "bits/stdc++.h"
#include <unordered_set>

#define _CRT_SECURE_NO_WARNINGS

#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--)

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

using namespace std;

const int INF = 1000000000;
const double PI = 3.1415926535897932384626433832795;

// N, E, S, W
const int dx[4] = { -1, 0,  1,  0 };
const int dy[4] = { 0, 1,  0, -1 };

using LL = long long int;
using LD = long double;
using pii = pair<int, int>;
using pdd = pair<double, double>;
using pll = pair<LL, LL>;
using vi = vector<int>;
using vd = vector<double>;
using vs = vector<string>;
using vvi = vector<vi>;
using vll = vector<LL>;

//==============================================

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

	LL m;
	cin >> m;

	if (m % 2 == 0 && m != 2) {
		cout << m / 2 << " " << 2 << "\n";
	} else if (m % 3 == 0 && m != 3) {
		cout << m / 3 << " " << 3 << "\n";
	} else if (m % 5 == 0 && m != 5) {
		cout << m / 5 << " " << 5 << "\n";
	} else if (m % 7 == 0 && m != 7) {
		cout << m / 7 << " " << 7 << "\n";
	} else if (m % 11 == 0 && m != 11) {
		cout << m / 11 << " " << 11 << "\n";
	} else if (m % 13 == 0 && m != 13) {
		cout << m / 13 << " " << 13 << "\n";
	} else if (m % 17 == 0 && m != 17) {
		cout << m / 17 << " " << 17 << "\n";
	} else if (m % 19 == 0 && m != 19) {
		cout << m / 19 << " " << 19 << "\n";
	} else {
		cout << m << " " << 1 << "\n";
	}
	return 0;
}