#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#include <queue>

#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define REP(i,a,n) for(int i = (a);i < (n);i++)
#define PI 3.14159265359
#define MOD 1000000007
#define chmax(a,b) if(a < b)a = b

using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> a(n+1,-1);
    queue<pair<int,int>> q;
    q.push({1,1});
    while(!q.empty()){
        int index = q.front().first;
        int count = q.front().second;
        a[index] = count;
        if(index == n)break;
        
        int add = 0,b = index;
        while(b > 0){
            add += b % 2;
            b /= 2;
        }
        
        if(a[index + add] == -1 && index + add <= n) q.push({index + add,count + 1});
        if(a[index - add] == -1 && index - add > 0) q.push({index - add,count + 1});
        q.pop();
    }
    cout << a[n] << endl;
    return 0;
}