#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(ll i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

int N;
int used[10010];
vector<int> edge[10010];
int main(){
    cin>>N;
    REP(i,1,N){
        int n=__builtin_popcount(i);
        if(CK(i+n,1,N+1)){
            edge[i].push_back(i+n);
        }
        if(CK(i-n,1,N+1)){
            edge[i].push_back(i-n);
        }
    }
    REP(i,1,N+1){
        used[i]=-1;
    }
    queue<int> q;
    q.push(1);
    used[1]=1;
    while(!q.empty()){
        int now=q.front();q.pop();
        for(auto v:edge[now]){
            if(used[v]!=-1) continue;
            used[v] = used[now] + 1;
            q.push(v);
        }
    }
    p(used[N]);

    return 0;
}