#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;

int main(){
    const int inf=1e6;
    int N;cin>>N;
    queue<int> que;
    que.push(1);
    vector<int> d(N+1,inf);
    d[1]=1;
    while(!que.empty()){
        int u=que.front();que.pop();
        int f=__builtin_popcount(u);
        if(u-f>0&&d[u-f]>d[u]+1){
            d[u-f]=d[u]+1;
            que.push(u-f);
        }
        if(u+f<N+1&&d[u+f]>d[u]+1){
            d[u+f]=d[u]+1;
            if(u+f!=N) que.push(u+f);
        }
    }
    if(d[N]==inf) cout<<-1<<endl;
    else cout<<d[N]<<endl;
}