#include <bits/stdc++.h> 

#define REP(i, b) for(int i = 0; i < (b); i++)
#define REPS(i, b) for(int i = 1; i <= (b); i++)
#define ALL(v) (v).begin(), (v).end()

using namespace std;

using ll = long long;
using ld = long double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<double>;
using vs = vector<string>;
using vb = vector<bool>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvb = vector<vb>;

const int INF = 1e9;
const int MOD = 1e9+7;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

signed main()
{
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    int N; cin >> N;
    vi d(N+1, INF); d[1] = 0;
    queue<int> q; q.push(1);
    while(!q.empty())
    {
        int p = q.front(); q.pop();
        int b = __builtin_popcount(p);
        if(p+b <= N && chmin(d[p+b], d[p]+1)) q.push(p+b);
        if(p-b >= 1 && chmin(d[p-b], d[p]+1)) q.push(p-b);
    }
    if(d[N] == INF) cout << -1 << endl;
    else cout << d[N]+1 << endl;
}