#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;

const int INF = 1001001001;

int nums[11111];
int dist[11111];

int main() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        nums[i] = __builtin_popcount(i);
    }
    for (int i = 0; i < 11111; i++) dist[i] = INF;
    dist[1] = 1;
    for (int i = 0; i < n; i++) {
        for (int j = 1; j <= n; j++) {
            if (j - nums[j] > 0) dist[j - nums[j]] = min(dist[j - nums[j]], dist[j] + 1);
            if (j + nums[j] < n + 1) dist[j + nums[j]] = min(dist[j + nums[j]], dist[j] + 1);
        }
    }
    cout << (dist[n] == INF ? -1 : dist[n]) << endl;
}