#include <iostream>
#include <math.h>
using namespace std;
typedef long long LL;
int IsPrime (LL n)
{
    int i;
	if (n < 2){
        return 0;
	}else if (n == 2){
        return 1;
	}
	if (n % 2 == 0){
        return 0;
	}
	double sqrtNum = sqrt((double)n);
	for (i = 3; i <= sqrtNum; i += 2){
		if (n % i == 0 ){
            return 0;
		}
	}
    return 1;
}
int main(int argc, char* argv[])
{
	LL C,i;
	cin>>C;
	if (C>2){
		if (IsPrime(C) == 1){
			cout<<1<<" "<<C<<endl;
			return 0;
		}
	}
	for (i=2;i<C;i++){
		if (C%i==0){
			cout<<i<<" "<<C/i<<endl;
			return 0;
		}
	}
	cout<<1<<" "<<C<<endl;
	return 0;
}