#include typedef long long ll; using namespace std; int INF = 1e9; int MOD = 1e9+7; main(){ ll N,A[3]; cin >> N; for(int i = (int)(pow(N,1./3)+1);i >= 1;i--){ if(N % i == 0){ A[0] = i; A[1] = N / i; break; } } for(int i = (int)(pow(N,1./3)+1);i >= 1;i--){ if(A[1] % i == 0){ A[2] = i; A[1] = A[1] / i; break; } } cout << A[0]+A[1]+A[2]-3 << " " << N-1 << endl; }