import std.stdio;
import std.string, std.conv, std.array, std.algorithm;
import std.uni, std.math, std.container;
import core.bitop;

void main(){
    auto N = readln.chomp.to!int;
    auto ans = bfs(N);
    ans.writeln;
}

auto bfs(int N){
    auto checked = new bool[](N + 1);
    auto d = new int[](N + 1);
    d[0] = 0, d[1] = 1;
    checked[0] = true, checked[1] = true;
    auto nxts = DList!int(1);

    while(!nxts.empty){
        int u = nxts.front;
        nxts.removeFront;

        if(u == N) return d[u];

        int st = popcnt(u);

        if(u + st <= N && !checked[u + st]){
            d[u + st] = d[u] + 1;
            nxts.insertBack(u + st);
            checked[u + st] = true;
        }
        if(u - st >= 0 && !checked[u - st]){
            d[u - st] = d[u] + 1;
            nxts.insertBack(u - st);
            checked[u - st] = true;
        }
    }

    return -1;
}