#include <bits/stdc++.h>
using namespace std;
int main(void){
    
    int n;
    cin >> n;
    
    queue<int> data;
    vector<int> dist(n+1, -1);
    
    data.push(1);
    dist[1] = 1;
    while(!data.empty()) {
        int index = data.front();
        data.pop();
        
        int bits = 0;
        for(int j=0; j<32; j++) {
            if(((index>>j)&0x01) == 0x01) bits++;
        }

        if(index-bits>0 && index-bits<=n && dist[index-bits] == -1) {
            dist[index-bits] = dist[index] + 1;
            data.push(index-bits);
        }
        if(index+bits>0 && index+bits<=n && dist[index+bits] == -1) {
            dist[index+bits] = dist[index] + 1;
            data.push(index+bits);
        }
    }
    
    cout << dist[n] << endl;
    
    return 0;
}