#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

bool used[10001];
int n;

int dfs(int p) {
    int ret, c = 0, num = p;
    if (p == n)
        return 1;
    else if (p < 1 || n < p || used[p])
        return INF;
    used[p] = true;
    while (num) {
        c += num % 2;
        num /= 2;
    }
    ret = dfs(p-c);
    return 1+min(ret,dfs(p+c));
}

int main() {
    int ret;
    cin >> n;
    ret = dfs(1);
    if (ret >= INF)
        cout << -1 << endl;
    else
        cout << ret << endl;
    return 0;
}