#include "bits/stdc++.h"
#define _CRT_SECURE_NO_WARNINGS
#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define Pi pair<int,int>
#define IINF 1e9
#define LINF 1e18
#define vi vector<int>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = { 1, 0,-1,0 };
int dy[] = { 0, 1,0,-1 };

void solve() {
	ll n;
	cin >> n;
	ll half;
	vector<ll> divisor;
	for (ll i = 1; i*i <= n; i++) {
		if (n % i == 0) {
			divisor.push_back(i);
		}
	}
	ll mini = 1e11;
	ll t;
	rep(i, divisor.size()) {
		rep(j, divisor.size()) {
			if (n % (divisor[i] * divisor[j]) == 0) {
				mini = min(mini, divisor[i] + divisor[j] + (n / (divisor[i] * divisor[j])) - 3);
			}
		}
	}
	cout << mini << " " << n - 1 << endl;
}

int main() {
	solve();
	return 0;
}