#include<iostream>
#include<queue>

//#define DEBUG
#define NMAX 10000

using namespace std;

int main(){
    int N;
    int min[NMAX+1];
    queue<int> que;

    cin>>N;
    for(int i=1;i<=N;i++){
        min[i]=-1;
    }

    que.push(1);
    min[1]=1;

    while(!que.empty()){
        int bitn;
        int p=que.front();
        
        #ifdef DEBUG
            for(int i=1;i<=N;i++){
                cout<<min[i]<<",";
            }
            cout<<endl;
        #endif
        que.pop();

        bitn=0;
        for(int i=0;(p>>i)!=0;i++){
            if((p>>i)&1==1) bitn++;
            #ifdef DEBUG
                cout<<p<<","<<(p>>i)<<endl;
            #endif
        }
        if(p-bitn>=1&&(min[p-bitn]==-1||min[p-bitn]>min[p]+1)){
            min[p-bitn]=min[p]+1;
            que.push(p-bitn);
        }
        if(p+bitn<=N&&(min[p+bitn]==-1||min[p+bitn]>min[p]+1)){
            min[p+bitn]=min[p]+1;
            que.push(p+bitn);
        }
    }
    cout<<min[N]<<endl;
}