#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll n;
ll ans[10005];
void solve(ll i){
    ll c=0,j=i;
    while(j>0){
        c=c+j%2;
        j=j/2;
    }
    if(i-c>=1&&ans[i-c]>ans[i]+1){
        ans[i-c]=ans[i]+1;
        solve(i-c);
    }
    if(i+c<=n&&ans[i+c]>ans[i]+1){
        ans[i+c]=ans[i]+1;
        solve(i+c);
    }
}
int main(void){
    cin>>n;
    ans[1]=1;
    for(int i=2;i<=n;i++){
        ans[i]=1000000000;
    }
    solve(1);
    if(ans[n]==1000000000){
        ans[n]=-1;
    }
    cout<<ans[n]<<endl;
    
}