#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <functional>
#include <tuple>
#include <climits>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <set>

using namespace std;

int count_bits(uint32_t i)
{
    i = i - ((i >> 1) & 0x55555555);
    i = (i & 0x33333333) + ((i >> 2) & 0x33333333);
    return (((i + (i >> 4)) & 0x0F0F0F0F) * 0x01010101) >> 24;
}

int solve(int N)
{
    queue<tuple<int, int>> tile;
    set<tuple<int, int>> move;
    enum {
        position=0,
        turn=1
    };
    enum {
        source = 0,
        destination = 1
    };

    if(N==1) return 1;
    tile.push(make_tuple(2, 1));
    while(!tile.empty()) {
        int i = get<position>(tile.front());
        int t = get<turn>(tile.front()) + 1;
        if(i==N) return t;
        int n = count_bits(i);
        tile.pop();
        if(i+n <= N && move.count(make_tuple(i, i+n)) == 0) {
            move.insert(make_tuple(i, i+n));
            tile.push(make_tuple(i+n, t));
        }
        if(i-n > 0 && move.count(make_tuple(i, i-n)) == 0) {
            move.insert(make_tuple(i, i-n));
            tile.push(make_tuple(i-n, t));
        }
    }
    return -1;
}

int main()
{
    int N;
    cin >> N;
    cout << solve(N) << endl;
}