#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
#endif
using ll = long long;
using ld = long double;
const ll INF = 1ll<<60;
const ld EPS = 1.0/1e9;
#define endl "\n"
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#define del(x) sort(all(x)); x.erase(unique(all(x)),x.end());

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ll n; cin >> n;
  vector<ll>dist(n+1,INF);
  queue<ll>que;
  dist[1]=1;
  que.push(1);
  while(!que.empty()){
    ll v=que.front(); que.pop();
    ll cnt=0;
    rep(i,0,20) if(v&(1ll<<i)) cnt++;
    if(v+cnt<=n && dist[v+cnt]==INF){
      dist[v+cnt]=dist[v]+1; que.push(v+cnt);
    }
    if(v-cnt>0 && dist[v-cnt]==INF){
      dist[v-cnt]=dist[v]+1; que.push(v-cnt);
    }
  }
  if(dist[n]==INF) cout << -1 << endl;
  else cout << dist[n] << endl;
}