def f(n)
	res=0
	while n>0
		if n%2==1 then
			res+=1
		end
		n/=2
	end
	return res
end

n=STDIN.gets.to_i
dp=Array.new(n+1,-1)
bs=[1]
dp[1]=1
while bs.empty? == false
	a=bs.shift
	p1=a-f(a)
	p2=a+f(a)
	if 0<p1 && p1<=n && dp[p1]==-1
		dp[p1]=dp[a]+1
		bs.push(p1)
	end
	if 0<p2 && p2<=n && dp[p2]==-1
		dp[p2]=dp[a]+1
		bs.push(p2)
	end
end
p dp[n]