#include <iostream>
#include<queue>
#include <bits/stdc++.h> 

using namespace std;
typedef long long ll;

ll dis[100000];

int main(){
    int N; cin>>N;
    queue<int> q;q.push(1);
    dis[1] = 1;
    
    while(!q.empty()){
        int x = q.front(); q.pop();
        bitset<32> bs(x);
        int v = bs.count();
        int next_dis = x + v; int pre_dis = x - v;
        if(next_dis<=N && dis[next_dis]==0){
            dis[next_dis] = dis[x] + 1;
            q.push(next_dis);
        }
        
        if(pre_dis<=N && dis[pre_dis]==0){
            dis[pre_dis] = dis[x] + 1;
            q.push(pre_dis);
        }
    }
    cout<<(dis[N]?dis[N]:-1)<<endl;
}