def Tmin(n)
	return (Math.sqrt(n) - 1) + (Math.sqrt(n) - 1) if n == (Math.sqrt(n).to_i * Math.sqrt(n).to_i)
	count = 0
	while n & 1 == 0
		count += 1
		n /= 2
	end
	count + (n == 0 ? 0 : n - 1)
end

n = gets.to_i
print Tmin(n).to_i
print ' '
puts n - 1