#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
const long long INF = 1e18;

vector<ll> dp(10100,INF);
vector<bool> visited(10100,false);
queue<ll> que;

ll stands(ll num){
    ll cnt=0;
    while(num>0){
        if(num%2==1) ++cnt;
        num/=2;
    }
    return cnt;
}

int main() {
    ll N;
    cin>>N;
    que.push(1);
    dp[1]=1;
    while(!que.empty()){
        ll node=que.front();que.pop();
        if(visited[node]) continue;
        visited[node]=true;
        ll st=stands(node);
        if (0<node-st && node-st<=N){
            dp[node-st]=dp[node-st]<dp[node]+1 ? dp[node-st] : dp[node]+1;
            que.push(node-st);
        }
        if (0<node+st && node+st<=N){
            dp[node+st]=dp[node+st]<dp[node]+1 ? dp[node+st] : dp[node]+1;
            que.push(node+st);
        }
    }
    if (dp[N]==INF) cout<<-1<<endl;
    else cout<<dp[N]<<endl;

    return 0;
}