#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <tuple>
#include <bitset>

#define rep(i,n) for(i=0; i<n; ++i)
#define dec_rep(i,n) for(i=n; i>=0; --i)
#define in(a) cin >> a
#define out(a,b) cout << a << b
#define print_vec(v) for(auto it=v.begin();it!=v.end();++it)cout<<*it <<" ";cout<<endl
#define print_vec2d(v) for(int i=0;i<v.size();++i){for(int j=0;j<v[i].size();++j)cout<<v[i][j]<<" ";cout<<endl;}cout<<endl
using namespace std;
using lint = long long;

int main(void){
    lint i, j, k, cnt=0, x, y;
    lint p, n, m;
    in(n);
    vector<lint> masu_cnt(n, -1);
    masu_cnt[0] = 1;

    vector<lint> cur_q={0};
    lint cur_i;

    while(!cur_q.empty()){
        cur_i = cur_q.front();
        cur_q.erase(cur_q.begin());
        bitset<14> bit(cur_i+1);
        lint move = bit.count();
        if(cur_i-move>=0&&masu_cnt[cur_i-move]<0){
            masu_cnt[cur_i-move] = masu_cnt[cur_i]+1;
            cur_q.push_back(cur_i-move);
        }
        if(cur_i+move<n&&masu_cnt[cur_i+move]<0){
            masu_cnt[cur_i+move] = masu_cnt[cur_i]+1;
            cur_q.push_back(cur_i+move);
        }
    }

    out(masu_cnt[n-1], endl);
    return 0;
}