#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define era(t) t.erase(unique(be(t)),t.end())
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
typedef long long ll;
using namespace std;
const ll mod=1000000007,mod9=1000000009;
template <class T>inline T lcm(T a,T b){return (a*b/__gcd(a,b));}

queue<int> q;
vector<bool> v;
vector<int> vi;
int n;

void solve(int p){
    if(v[p])return;
    v[p]=true;
    int maki=p;
    int num=0;
    while(maki){
        if(maki%2==1){
            num++;
        }
        maki/=2;
    }
    int pm=p-num;
    int pp=p+num;
    if(pm>0&&!(v[pm])){
        vi[pm]=min(vi[p]+1,vi[pm]);
        q.push(pm);
    }
    if(pp<=n&&!(v[pp])){
        vi[pp]=min(vi[p]+1,vi[pp]);
        q.push(pp);
    }
    return;
}
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin>>n;
    if(n==1){
        cout<<1<<endl;
        return 0;
    }
    for(int i=0;i<=n;i++){
        v.pb(false);
        vi.pb(1e9);
    }
    vi[1]=1;
    q.push(1);
    while(!q.empty()){
        solve(q.front());
        q.pop();
    }
    if(v[n]==true){
        cout << vi[n] <<endl;
    }
    else{
        cout << -1<<endl;
    }

    
    return 0;
}