Divide candy Huawei od JS

Xiao Ming grabs a handful of candy at random from the candy box , Every time Xiao Ming takes out half of the candy and gives it to the students .

When candy is not evenly distributed , Xiao Ming can choose from the candy box （ Suppose there are enough candy in the box ） Take out a candy or put back a candy .

How many times does Xiao Ming need at least （ Take out 、 Put it back and distribute it evenly once ）, Can divide the candy in your hand to only one .

Input description :

Number of sweets grabbed （<10000000000）：

15

Output description :

The number of times to get at least one candy ：

5

---

Input

15

Output

5

remarks :

explain ：(1)15+1=16;(2)16/2=8;(3)8/2=4;(4)4/2=2;(5)2/2=1;

let a=Number(readline())
	let res=[]
	function f(n,m){
		if(n==1){
			res.push(m)
			return 1
		}
		if(n%2==0){
			m++
			f(n/2,m)
		}else{
			m++
			f(n-1,m)
			f(n+1,m)
		}
		return 0
	}
	f(a,0)
	res.sort((a,b)=>a-b)
	console.log(res[0])