def count_bits(n)
  if n == 0
    0
  else
    ((n & 1) == 0 ? 0 : 1) + count_bits(n >> 1)
  end
end

def f(n)
  inf = -1
  q = [1]
  visited = [inf]*(N_MAX+1)
  visited[1] = 1

  while !q.empty?
    curr = q.shift
    bits = count_bits(curr)

    [curr - bits, curr + bits].each{|nxt|
      next if !nxt.between?(1, n)
      next if visited[nxt] != inf
      visited[nxt] = visited[curr] + 1
      q << nxt
    }
  end
  visited[n]
end

N_MAX = 10000
N = gets.to_i
p f(N)