#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define MAX 1e18
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
signed main(){
  ll N;cin>>N;vector<ll>A(N,MAX);A[0]=1;
  min_priority_queue<P>Q;Q.push(P(1,0));
  while(Q.size()){
    ll x=Q.top().S+1,p=0;Q.pop();REP(i,20)if((x>>i)%2==1)p++;
    if(x-p>0&&A[x-p-1]>A[x-1]+1){A[x-p-1]=A[x-1]+1;Q.push(P(A[x-1]+1,x-p-1));}
    if(x+p<=N&&A[x+p-1]>A[x-1]+1){A[x+p-1]=A[x-1]+1;Q.push(P(A[x-1]+1,x+p-1));}
  }
  if(A[N-1]==MAX)A[N-1]=-1;cout<<A[N-1]<<endl;
  return 0;
}