#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define repr(i, a, b) for(ll i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
const ll MOD = 1000000007;
const ll INF = 100000000000000000LL;
inline ll GCD(ll a, ll b){ return b?GCD(b, a % b):a; }
inline ll LCM(ll a, ll b){ return a/GCD(a, b)*b; }
inline ll powint(ll x, ll y){ ll r=1; while(y){ if(y&1) r*=x; x*=x; y>>=1; } return r; }
inline ll powmod(ll x, ll y, ll m = MOD){ ll r=1; while(y){ if(y&1) r*=x; x*=x; r%=m; x%=m; y>>=1; } return r; }
template<class T>bool chmax(T &a, const T &b){ if(a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b){ if(b<a) { a=b; return 1; } return 0; }
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif

ll n;
vi visited(10010, 0);

// グラフに対する幅優先探索
int bfs(ll start, ll goal){
    queue<pll> q;
    visited[start] = 1;
    ll depth = 0;
    ll now = start;
    q.push(make_pair(now, depth));
    while(!q.empty()){
        now = q.front().first;
        depth = q.front().second;
        q.pop();
        dump(now, depth);
        if(now == goal){
            return depth+1;
        }
        rep(i, 2){
            int pc = __builtin_popcountll(now);
            ll next = (i == 0 ? now+pc : now-pc);
            dump(next);
            if(next >= 1 && next <= n && !visited[next]){
                visited[next] = 1;
                q.push(make_pair(next, depth+1));
            }
        }
    }
    return -1;
}

int main(){
    cin.tie(0); ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cin >> n;
    cout << bfs(1, n) << endl;
    return 0;
}