#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;

bool visited[101010];

int main() {
    int N;
    cin >> N;

    queue<P> que;
    que.push({1, 1});
    visited[1] = true;
    while (que.size()) {
        P p = que.front(); que.pop();

        if (p.first == N) {
            cout << p.second << endl;
            return 0;
        }
        int b = p.first;
        int x = b + __builtin_popcount(p.first);
        if (x <= N and !visited[x]) {
            visited[x] = true;
            que.push({x, p.second+1});
        }

        int y = b - __builtin_popcount(p.first);
        if (y >= 1 and !visited[y]) {
            visited[y] = true;
            que.push({y, p.second+1});
        }
    }

    cout << -1 << endl;
}