def inp() a=gets.chomp.split(" ").map(&:to_i)end 
def inpf() a=gets.chomp.split(" ").map(&:to_f)end
def inpss() a=gets.chomp.split(" ")end  
def copy(a) Marshal.load(Marshal.dump(a)) end
def kaizyo(n)(n < 2)? 1 : (2..n).inject(:*) end
def scount(a) b=na(a.max+1);a.each{|n|b[n]+=1};return b end
def na(n,d=0) Array.new(n,d)end
def na2(n,m,d=0) Array.new(n){Array.new(m,d)}end
def na3(n,m,l,d=0) Array.new(n){Array.new(m){Array.new(l,d)}}end
def bit(n) n.to_s(2).split("").map(&:to_i) end
def cals(x,y,ax,ay,bx,by) ((ax-x)*(by-y)-(bx-x)*(ay-y)*-1)/2.to_f end
memo = {}
n = inp[0]
que = [[1,1]]
while(que.size != 0)
  now = que.shift
  next if(memo[now[0]]==1)
  if(now[0] == n)
    puts now[1]
    exit
  end
  memo[now[0]] = 1
  pu = now[0]+bit(now[0]).count(1) 
  que.push([pu,now[1]+1]) if(pu <= n)
  mi = now[0]-bit(now[0]).count(1) 
  que.push([mi,now[1]+1]) if(mi > 0)
end
puts -1

=begin


=end