#include <bits/stdc++.h>
#include <atcoder/all>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace atcoder;
using namespace __gnu_pbds;
using ll=long long;
using ld=long double;
using vll=vector<ll>;
using vvll=vector<vll>;
using pll=pair<ll,ll>;

// using mint=modint;

// template<class K,class V>
// using ordered_map=tree<K,V,less<K>,rb_tree_tag,tree_order_statistics_node_update>;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

    ll N;
    cin>>N;
    vll dist(N+1,-1);
    queue<ll>q;
    dist[1]=1;
    q.push(1);

    while(!q.empty()){
        ll u=q.front();
        q.pop();
        ll d=__builtin_popcount(u);
        ll l=u-d,r=u+d;
        if(l>=1&&dist[l]==-1){
            dist[l]=dist[u]+1;
            q.push(l);
        }
        if(r<=N&&dist[r]==-1){
            dist[r]=dist[u]+1;
            q.push(r);
        }
    }

    cout<<dist[N]<<endl;

}