#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }

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

  int n;
  cin >> n;
  vector<int> v(n + 1, 0);
  rep(i, 1, n + 1) v[i] = __builtin_popcount(i);

  vector<int> dp(n + 1, 1e9);
  dp[1] = 1;
  rep(i, 1, n) {
    if (i + v[i] > n) {
      if (dp[i] == 1e9)
        continue;
      if (dp[i - v[i]] != 1e9) {
        if (dp[i - v[i]] > dp[i] + 1) {
          dp[i - v[i]] = dp[i] + 1;
          i -= (v[i] + 1);
        }
        continue;
      }
      dp[i - v[i]] = dp[i] + 1;
      i -= (v[i] + 1);
    } else {
      if (i - v[i] > 0 && dp[i - v[i]] > dp[i] + 1) {
        dp[i - v[i]] = dp[i] + 1;
        i -= (v[i] + 1);
      } else
        chmin(dp[i + v[i]], dp[i] + 1);
    }
  }

  if (dp[n] == 1e9)
    cout << -1 << endl;
  else
    cout << dp[n] << endl;
}