#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <fstream>
#include <bitset>
#include <time.h>

#define ll long long
#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define EPS 1e-14

using namespace std;


int bit_count(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(int argc, char *argv[]) {
    int N;
    cin >> N;
   
    vector<int> dp(N + 1, -1); 
    dp[1] = 1;
    queue<int> q;
    q.push(1);

    while (!q.empty()) {
        auto now = q.front(); q.pop();
        if (now == N) {
            break;
        }

        int n1 = now + bit_count(now);
        int n2 = now - bit_count(now);

        for (int i = -1; i <= 1; i += 2) {
            int next = now + i * bit_count(now);
            if (0 <= next && next <= N) {
                if (dp[next] == -1) {
                    dp[next] = dp[now] + 1;
                    q.push(next);
                }
            }
        }
    }

    cout << dp[N] << endl;
    
    return 0;
}