#include<iostream>
#include<string>
#include<algorithm>

long long is_prime(long long n) {
	if (n <= 3) return n;
	if (n % 2 == 0) return 2;
	if (n % 3 == 0) return 3;
	if (n == 5 || n == 7) return n;

	for (long long i = 5; i * i <= n; i+=2) {
		if (n % i == 0) return i;
	}

	return n;
}

int main() {
	long long n;

	std::cin >> n;

	long long a = is_prime(n);


	if (a == n) {
		std::cout << 1 << " " << n << std::endl;
	} else {
		std::cout << a << " " << n / a << std::endl;
	}

	return 0;
}