#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for(int i = a; i < (int)b; ++i)
#define rrep(i, n) for(int i = ((int)n - 1); i >= 0; --i)

typedef long long ll;
typedef long double ld;

const int Inf = 1e9;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;

int bitCount(long bits) {
    bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
    bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
    bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
    bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
    return (bits & 0x0000ffff) + (bits >>16 & 0x0000ffff);
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<int> res(n + 1, Inf), square(n + 1);
    rep (i, n + 1) square[i] = bitCount(i);
    res[1] = 1;
    queue<pair<int, int> > q;
    q.push(make_pair(1, -1));
    while (!q.empty()) {
        int s, p;
        s = q.front().first; p = q.front().second;
        q.pop();
        if (s != 1 && res[s] != Inf) continue;
        if (p != -1) res[s] = res[p] + 1;
        if (s + square[s] <= n + 1 && s + square[s] >= 1) q.push(make_pair(s + square[s], s));
        if (s - square[s] <= n + 1 && s - square[s] >= 1) q.push(make_pair(s - square[s], s)); 
    }
    if (res[n] == Inf) cout << -1 << endl;
    else cout << res[n] << endl;
    
    return 0;
}