#include <iostream>
#include <vector>
#include <array>
#include <queue>

using namespace std;

#define MAX_N 10000

int N;
queue<int> que;
vector<int> dp(MAX_N + 1, -1);

int binary_1_count(int num){
  int count_1 = 0;
    while (num > 1){
      if (num % 2 == 1) count_1 += 1;
      num /= 2;
    }
    count_1 += 1;
    return count_1;
}

int main(){
  // cin.tie(0);
  cin>>N;
  que.push(1);
  dp[1] = 1;

  while (que.size() > 0) {
    int q = que.front();
    int count_1 = binary_1_count(q);
    array<int, 2> list{-count_1, count_1};
    for (auto e : list) {
      if ((q + e) > 0 && dp[q + e] == -1) {
        dp[q+e] = dp[q] + 1;
        que.push(q+e);
      }
    }
    que.pop();
  }

  if (dp[N] != -1) cout<<dp[N]<<endl;
  else cout<<-1<<endl;

  return 0;
}