N = gets.to_i

def binary_1_count(num)
  count_1 = 0
  while num > 1 do
    count_1 += 1 if num % 2 == 1
    num /= 2
  end
  count_1 += 1
end

def main
  res = -1
  queue = [{pos: 1, time: 1}]
  dp = Array.new(N+1,false)
  dp[1] = true

  while queue.length > 0 do
    q = queue.shift
    if q[:pos] == N
      res = q[:time]
      break
    end
    count_1 = binary_1_count(q[:pos])
    if q[:pos] - count_1 > 0 && !dp[q[:pos]-count_1]
      queue << {pos: q[:pos] - count_1, time: q[:time] + 1} 
      dp[q[:pos]-count_1] = true
    end
    if q[:pos] + count_1 <= N && !dp[q[:pos]+count_1]
      queue << {pos: q[:pos] + count_1, time: q[:time] + 1} 
      dp[q[:pos]+count_1] = true
    end
  end

  p res
end

main()