#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <limits>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <complex>

using namespace std;

#define INF (INT_MAX/3)
#define PI (2*acos(0.0))
#define EPS (1e-8)

typedef long long ll;
typedef unsigned long long ull;

int N;

int cntBit(int b){
    int cnt = 0;
    for(int i = 0; i < 14; i++) cnt += (b & (i << 1));
    return cnt;
}

int solve(){
    int minDis = INF;
    pair<int, int> s(1, 0);
    queue<pair<int, int> > que;
    set<int> e;
    que.push(s);

    while(!que.empty()){
        pair<int, int> n = que.front(); que.pop();
        if(n.first > N || n.first < 1 || e.find(n.first) != e.end()) continue;
        if(n.first == N) { minDis = min(minDis, n.second); break;}
        e.insert(n.first);
        int b = __builtin_popcount(n.first);
        que.push(pair<int, int>(n.first + b, n.second + 1));
        if(n.first - b != 1) que.push(pair<int, int>(n.first - b, n.second + 1));
    }

    return minDis;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin >> N;
    int minDis = solve();
    if(minDis == INF) cout << -1 << endl;
    else cout << minDis + 1 << endl;
    return 0;
}