def prime_num(n):
	prime = [2]
	for k in range(3,n + 1):
		i = 2
		f = True
		while i * i <= k:
			if k % i == 0:
				f = False
				break
			i += 1
		if f:
			prime.append(k)
	return prime
N = int(input())
prime = prime_num(N)
maxAns = N - 1
minAns = 0
n = N
i = 0
div = 0
while n not in prime and i < len(prime):
	while n % prime[i] == 0:
		div += prime[i] - 1
		n //= prime[i]
	i += 1
minAns += n - 1 + div
print(minAns,maxAns)