#include <iostream>
#include <algorithm>
#include <stdlib.h>
#include <string>
#include <queue>
using namespace std;


int b(int a){
int k=0;
for(int y=0;y<8;y++){
if(a&1 == 1 ) k=k+1;
a=a >> 1;
}
return k;
}


int main() {
queue<pair<int,int> > q; //iti,kaisuu
int n;
int ch[100000]={0};
ch[1]=1;
pair<int,int> z;
cin>>n;
q.push(make_pair(1,1));
int ans=-1;
int kaisuu=-1,ichi;
while(q.size() != 0){
z=q.front();
 ichi=z.first;
kaisuu=z.second;
if(ichi==n) {
ans=kaisuu;
break;
}
if(0< ichi+b(ichi) && ichi+b(ichi) <n+1){
if(ch[ichi+b(ichi)]==0) {
q.push(make_pair(ichi+b(ichi),kaisuu+1));
ch[ichi+b(ichi)]=1;
}
//cout<<ichi+b(ichi)<<" "<<kaisuu+1<<endl;
}

if(0< ichi-b(ichi) && ichi-b(ichi) <n+1){
if(ch[ichi-b(ichi)]==0) {
q.push(make_pair(ichi-b(ichi),kaisuu+1));
ch[ichi-b(ichi)]=1;
}
//cout<<ichi-b(ichi)<<" "<<kaisuu+1<<endl;
}
q.pop();


}



cout<<ans<<endl;

return 0;
}