#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
template<class T> inline bool chmin(T& a, T b){
    if(a>b){a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){
    if(a<b){a=b;return true;}return false;}
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9;
const ll INF=4e18;
const ll dy[4]={1,0,-1,0};
const ll dx[4]={0,-1,0,1};
int main(){
    int N;cin>>N;
    vvl info(N);
    rep(i,N){
        int p=__builtin_popcount(i+1);
        if(i-p>=0)info[i].push_back(i-p);
        if(i+p<N)info[i].push_back(i+p);
    }
    vl dist(N,inf);
    queue<int> que;
    que.push(0);
    dist[0]=1;
    while(que.size()){
        int q=que.front();
        que.pop();
        for(auto p:info[q]){
            if(dist[q]+1<dist[p]){
                dist[p]=dist[q]+1;
                que.push(p);
            }
        }
    }
    if(dist[N-1]==inf)cout<<-1<<endl;
    else cout<<dist[N-1]<<endl;
    return 0;
}