#include<bits/stdc++.h>
using namespace std;
const int INF=1e9;
int main(){
    int n;cin >> n;
    vector<int> d(n+1,INF);
    vector<vector<int>> g(n+1);
    for(int i=1;i<=n;i++){
        int cnt=0;
        for(int j=0;j<32;j++){
            if((i>>j)&1){
                cnt++;
            }
        }
        if(i-cnt>=1){
            g[i].push_back(i-cnt);
        }
        if(i+cnt<=n){
            g[i].push_back(i+cnt);
        }
    }
    vector<bool> vis(n+1);
    queue<int> q;
    q.push(1);
    d[1]=1;
    vis[1]=1;
    while(!q.empty()){
        int p=q.front();
        q.pop();
        for(auto x:g[p]){
            if(!vis[x]){
                d[x]=d[p]+1;
                vis[x]=true;
                q.push(x);
            }
        }
    }
    if(d[n]==INF){
        cout << -1 << endl;
    }
    else{
        cout << d[n] << endl;
    }
}