#include #define REP(i, n) for(int i=0;i<(n);++i) #define LL long long using namespace std; int prime(int x){ if(x<=1) return 1; for(int i=2;i*i<=x;i++) if(x%i==0) return i; return 1; } int main(void) { int C; cin >> C; int a = prime(C); cout << a << " " << C/a << endl; }