def prime_num(n):
	prime = [2]
	i = 3
	while i * i <= n:
		if n % i == 0:
			prime.append(i)
		i += 1
	return prime

N = int(input())
prime = prime_num(N)
maxAns = N - 1
n = N
div = 0
i = 0
while n not in prime and i < len(prime):
	while n % prime[i] == 0:
		div += 1
		n //= prime[i]
	i += 1
minAns = n - 1 + div
print(minAns,maxAns)