#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <cstring>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < int(n);i++)

int main(){
  int n;
  cin >> n;
  vector<int> d(10032,1 << 30);
  queue<int> q;
  q.push(1);
  d[1] = 0;
  while(!q.empty()){
    int x = q.front(); q.pop();
    int add = __builtin_popcount(x);
    if (x + add  <= n && d[x + add] == 1 << 30){
      d[x+add] = d[x]+1;
      q.push(x+add);
    }
    if (0 < x-add && d[x-add] == 1 << 30){
      d[x-add] = d[x] + 1;
      q.push(x-add);
    }
  }
  if (d[n] == 1 << 30) cout << -1 << endl;
  else cout << d[n] + 1 << endl;
  


  return 0;
}