// Template {{{
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
using namespace std;
typedef long long LL;

#ifdef LOCAL
#include "contest.h"
#else
#define dump(x) 
#endif

class range {
    struct Iterator {
        int val, inc;
        int operator*() {return val;}
        bool operator!=(Iterator& rhs) {return val < rhs.val;}
        void operator++() {val += inc;}
    };
    Iterator i, n;
    public:
    range(int e) : i({0, 1}), n({e, 1}) {}
    range(int b, int e) : i({b, 1}), n({e, 1}) {}
    range(int b, int e, int inc) : i({b, inc}), n({e, inc}) {}
    Iterator& begin() {return i;}
    Iterator& end() {return n;}
};

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
inline bool valid(int x, int w) { return 0 <= x && x < w; }

void iostream_init() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.setf(ios::fixed);
    cout.precision(12);
}
//}}}

const int INF = 1000000000;
vector<int> SPFA(int n) {
    vector<int> dist(n, INF);
    vector<bool> inque(n);
    queue<int> que;
    int s = 0;

    dist[s] = 1;
    que.push(s);
    inque[s] = true;
    while(!que.empty()){
        int v = que.front();
        que.pop();
        inque[v] = false;
        for(int k = -1; k <= 1; k++) {
            int dst = v + k*__builtin_popcount(v+1);
            if(dst < 0) continue;
            if(dst >= n) continue;
            if(dist[dst] > dist[v] + 1) {
                dist[dst] = dist[v] + 1;
                if(!inque[dst]) {
                    que.push(dst);
                    inque[dst] = true;
                }
            }
        }
    }
    return dist;
}
int main(){
    iostream_init();
    int N;
    cin >> N;
    auto res = SPFA(N);
    if(res[N-1] >= INF) res[N-1] = -1;
    cout << res[N-1] << endl;

    return 0;
}

/* vim:set foldmethod=marker: */