#include <bits/stdc++.h>
using namespace std;

using Int = int_fast64_t;
using Word = uint_fast64_t;
using Int128 = __int128_t;
using Word128 = __uint128_t;
using VInt = vector<Int>;
using VVI = vector<VInt>;
using VWord = vector<Word>;
using VVW = vector<VWord>;
using VS = vector<string>;
using VVS = vector<VS>;
using VB = vector<bool>;
using VVB = vector<VB>;
using PII = pair<Int,Int>;
using PWW = pair<Word,Word>;
using VPII = vector<PII>;
using VPWW = vector<PWW>;

#define SZ(x) ((Int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define rep(i,n) for(Int i=0, i##_len=(n); i<i##_len; ++i)
#define reps(i,n) for(Int i=0, i##_len=(n); i<=i##_len; ++i)
#define Range(i,a,b) for(Int i=a; i<=(Int)(b); i++)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define pb push_back
#define eb emplace_back

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  Int n;
  cin >> n;

  queue<PII> que;
  bool used[10001];

  que.push(PII(1,1));
  while (!que.empty()) {
    PII p = que.front(); que.pop();
    Int s = __builtin_popcount(p.first);
    if (p.first == n) {
      cout << p.second << '\n';
      return 0;
    }
    if (p.first + s <= n && !used[p.first + s]) {
      que.push(PII(p.first + s, p.second + 1));
      used[p.first + s] = true;
    }
    if (p.first - s >= 1 && !used[p.first - s]) {
      que.push(PII(p.first - s, p.second + 1));
      used[p.first - s] = true;
    }
  }
  cout << "-1\n";
  return 0;
}