#include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>

using namespace std;

static int count_bits(int i)
{
    auto b = 0;
    while (i > 0) {
        if (i & 0x01) ++b;
        i >>= 1;
    }

    return b;
}

struct Move
{
    int pos;
    int count;
};

static void run()
{
    int n;
    cin >> n;

    vector<int> bits(n + 1, 0);
    for (auto i = 1; i <= n; ++i) {
        bits[i] = count_bits(i);
    }

    vector<bool> done(n + 1, false);

    queue<Move> q;
    q.push(Move{1, 1});

    const auto kCannotReach = 10001;
    int result = kCannotReach;
    while (!q.empty()) {
        const auto move = q.front();
        q.pop();
        if (move.pos == n) {
            result = min(result, move.count);
            continue;
        }

        if (move.pos < 1 || move.pos > n || done[move.pos]) {
            result = min(result, kCannotReach);
            continue;
        }
        done[move.pos] = true;

        q.push(Move{move.pos + bits[move.pos], move.count + 1});
        q.push(Move{move.pos - bits[move.pos], move.count + 1});
    }

    cout << (result == kCannotReach ? -1 : result) << endl;
}

int main(int argc, char **argv)
{
    run();
    return 0;
}