#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>

void factor(long long n, std::vector<long long> &v) {
	v.push_back(1);
	while (n % 2 == 0) {
		for (int i = v.size() - 1; i >= 0; i--) {
			v.push_back(v[i] * 2);
		}
		n /= 2;
	}
	while (n % 3 == 0) {
		for (int i = v.size() - 1; i >= 0; i--) {
			v.push_back(v[i] * 3);
		}
		n /= 3;
	}
	while (n % 5 == 0) {
		for (int i = v.size() - 1; i >= 0; i--) {
			v.push_back(v[i] * 5);
		}
		n /= 5;
	}

	long long end = sqrt(n);
	for (long long i = 6; i <= end; i+=6) {
		while (n % (i - 1) == 0) {
			for (int j = v.size() - 1; j >= 0; j--) {
				v.push_back(v[j] * (i - 1));
			}
			n /= (i - 1);
		}
		while (n % (i + 1) == 0) {
			for (int j = v.size() - 1; j >= 0; j--) {
				v.push_back(v[j] * (i + 1));
			}
			n /= (i + 1);
		}
	}
}

int main() {
	long long n;

	std::cin >> n;

	long long max = n - 1, min = n - 1;

	long long a, b, c;

	std::vector<long long> v;

	factor(n, v);

	for (long long i : v) {
		if (i * i * i > n) break;
		if (n % i != 0) continue;
		long long tn = n / i;
		for (long long j = i; j * j <= tn; j++) {
			if (tn % j != 0) continue;
			min = std::min(min, i + j + tn / j - 3);
		}
	}

	std::cout << min << " " << max << std::endl;
	return 0;
}