// yukicoder: No.375 立方体のN等分 (1)
// 2019.5.10 bal4u

#include <stdio.h>
#include <math.h>

long long comb(long long n) {
	long long max, s;
	int y;
	max = n-1;
	int b = (int)sqrt((double)n);
	for (y = 2; y <= b; y++) {
		if (n%y == 0) {
			s = y + n/y - 2;
			if (s < max) max = s;
		}
	}
	return max;
}

int main()
{
	long long N, max, s;
	int b, x;
	
	scanf("%lld", &N);
	b = (int)sqrt((double)N);
	max = N-1;for (x = 2; x <= b; x++) {
		if (N%x == 0) {
			s = x-1 + comb(N/x); if (s < max) max = s;
			s = N/x-1 + comb(x); if (s < max) max = s;
		}
	}
	printf("%lld %lld\n", max, N-1);
	return 0;
}