let get arr i   = arr.(i-1)
let set arr i v = arr.(i-1) <- v

let rec value_of_cell n acc =
  if n = 0 then acc
  else value_of_cell (n / 2) (acc + (n mod 2))

let value_of_cell n = value_of_cell n 0

let gen_graph n =
  let g = Array.make n [] in
  for i = 1 to n do
    let v = value_of_cell i in
    if i+v <= n then set g (i+v) (i::(get g (i+v)));
    if 1 <= i-v then set g (i-v) (i::(get g (i-v)))
  done; g

let bfs n graph nodes =
  let q = Queue.create () in
  Queue.push n q;
  let rec inner () =
    if Queue.is_empty q then (-1)
    else
      begin
        let v = Queue.pop q in
        if v = 1 then get nodes v
        else 
          begin
            List.iter (fun l -> 
                if get nodes l = (-1) then Queue.push l q; set nodes l ((get nodes v) + 1))
              (get graph v);
            inner ()
          end
      end
  in inner ()

let solve n =
  let nodes = Array.make n (-1) in
  set nodes n 1;
  let g = gen_graph n in
  print_int @@ bfs n g nodes

let _ =
  let n = int_of_string @@ read_line() in
  solve n