#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}


int main(int argc, char const *argv[]) {
  ll n;std::cin >> n;
  vll ans(n+1, 10000000000);
  deque<pair<ll, ll>> q;
  q.push_back({1, 1});

  while(!q.empty()){
    pair<ll, ll> t = q.front();
    q.pop_front();
    if(ans[t.first]<t.second) continue;
    ans[t.first] = t.second;
    //std::cout << t.first << '\n';
    ll cnt = __builtin_popcount(t.first);

    if(t.first+cnt<=n&&t.second+1<ans[t.first+cnt]){
      ans[t.first+cnt] = t.second + 1;
      q.push_back({t.first+cnt, t.second+1});
    }

    if(t.first-cnt>0&&t.second+1<ans[t.first-cnt]){
      ans[t.first-cnt] = t.second + 1;
      q.push_back({t.first-cnt, t.second+1});
    }
  }
  std::cout << (ans[n]==10000000000?-1:ans[n]) << '\n';
}