import std.algorithm, std.array, std.container, std.range;
import std.string, std.conv, std.math;
import std.stdio, std.typecons;

alias Tuple!(int, "p", int, "c") qitem;

void main()
{
  auto n = readln.chomp.to!int;

  writeln(calc(n));
}

int calc(int n)
{
  auto q = DList!qitem(qitem(1, 1));
  auto visited = new bool[n + 1];
  visited[1] = true;

  while (!q.empty) {
    auto qi = q.front;
    q.removeFront;

    if (qi.p == n) {
      return qi.c;
    } else {
      auto b = bits(qi.p);

      auto p1 = qi.p - b;
      if (p1 >= 1 && !visited[p1]) {
        q.insertBack(qitem(p1, qi.c + 1));
        visited[p1] = true;
      }

      auto p2 = qi.p + b;
      if (p2 <= n && !visited[p2]) {
        q.insertBack(qitem(p2, qi.c + 1));
        visited[p2] = true;
      }
    }
  }
  return -1;
}

int bits(int n)
{
  auto c = 0;
  while (n > 0) {
    if ((n & 1) == 1)
      c += 1;
    n >>= 1;
  }
  return c;
}