#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <tuple>
#include <bitset>

#define rep(i,n) for(i=0; i<n; ++i)
#define in(a) cin >> a
#define out(a,b) cout << a << b
#define print_vec(v) for(auto it=v.begin();it!=v.end();++it)cout<<*it <<" ";cout<<endl
#define print_vec2d(v) for(int i=0;i<v.size();++i){for(int j=0;j<v[i].size();++j)cout<<v[i][j]<<" ";cout<<endl;}cout<<endl
using namespace std;
using lint = long long;

string base_conv(lint n, lint r){
    string str = "";
    if(n<0||r<2);   // なにもしない
    else{
        char pop; int num;
        while(n){
            num = n%r;
    
            if(num>9)  pop = 'A'+num-10;
            else    pop = '0'+num;
    
            str = pop + str;
            n/=r;
        }
    }
    return str;
}

int count_string(string str, char c){
    int cnt=0, i;
    rep(i,str.size()){
        cnt+=str[i]==c;
    }
    return cnt;
}

void write_vec(int indx, vector<lint> &x){
    string bin_s=base_conv(indx+1, 2);
    int cnt=count_string(bin_s, '1');
    if(indx-cnt>0&&x[indx-cnt]<0){
        x[indx-cnt]=x[indx]+1;
        write_vec(indx-cnt, x);
    }
    if(indx+cnt<x.size()&&x[indx+cnt]<0){
        x[indx+cnt]=x[indx]+1;
        write_vec(indx+cnt, x);
    }
    return;
}

int main(void){
    lint i, j, k;
    lint p, n, m;
    in(n);
    vector<lint> count(n, -1);
    count[0]=1;
    write_vec(0, count);

    out(count[n-1],endl);

    return 0;
}