#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

int main()
{
	ll N,mx,mi=0,num;
	cin >> N;

	mx = N - 1;
	if (N % 2 != 0)mi = N - 1;
	else {
		mi = 1e11;
		for (int i = 1; i < 10000; i++) {
			for (int j = 1; j < 10000; j++) {
				if (N % (i*j) == 0) {
					mi = min(i - 1 + j - 1+(N/(i*j))-1,mi);
				}
			}
		}
	}
	cout << mi << " " << mx << endl;
	return 0;
}