#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#include <iomanip>
using namespace std;
typedef long long ll;


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	ll N;
	cin >> N;

	vector<ll> div;
	for(ll i = 1; i * i <= N; i++) {
		if(N % i == 0) {
			div.push_back(i);
			div.push_back(N / i);
		}
	}

	ll tmin = N - 1;
	for(int i = 0; i < div.size(); i++) {
		for(int j = 0; j < div.size(); j++) {
			if(N % (div[i] * div[j]) == 0) {
				tmin = min(tmin, div[i] + div[j] + N / div[i] / div[j] - 3);
			}
		}
	}

	cout << tmin << " " << N - 1 << endl;
}