#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;

constexpr int INF = 1e9;
int N;
vector<int> ans;

int GO(int x) {
    int res = 0;
    while (x) {
        res += x % 2;
        x /= 2;
    }
    return res;
}

int searchf(int x) {
    if (x <= 0 || N < x) return INF;
    if (x == N) return 1;
    if (ans[x] != -1) return ans[x];
    ans[x] = INF;
    int res = min(searchf(x + GO(x)), searchf(x - GO(x))) + 1;
    ans[x] = res;
    return res;
}

int main() {
    cin >> N;
    ans = vector<int>(N + 1, -1);
    if (searchf(1) >= INF) cout << -1 << endl;
    else cout << searchf(1) << endl;
}