#include<cstdio>
#include<vector>
#include<algorithm>
#include<iostream>
#include<cassert>
#include<cstring>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
using namespace std;
typedef pair<int,int>pint;
typedef vector<int>vint;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);i++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

int N;
int dist[10001];
const int INF=1001001001;
int main(){
    cin>>N;
    fill_n(dist,10001,INF);
    dist[1]=1;

    queue<int>que;
    que.push(1);
    while(que.size()){
        int p=que.front();que.pop();
        int cnt=0;
        rep(i,20)if(p>>i&1)cnt++;
        if(p+cnt<=N&&dist[p+cnt]>dist[p]+1){
            dist[p+cnt]=dist[p]+1;
            que.push(p+cnt);
        }
        if(p-cnt>0&&dist[p-cnt]>dist[p]+1){
            dist[p-cnt]=dist[p]+1;
            que.push(p-cnt);
        }
    }

    if(dist[N]==INF)cout<<-1<<endl;
    else cout<<dist[N]<<endl;

    return 0;
}