#include <iostream>
using namespace std;

int count_bit(int N) {
    int sum = 0;
    for (int i = 0; i < 15; i++) {
        sum += (N >> i) & 1;
    } 
    return sum;
}

void output(int N, int masu[]) {
    for (int i = 1; i < N + 1; i++) {
        cout << masu[i];
    }
    cout << endl;
}

int main(void) {
    int N;
    cin >> N;

    if (N == 1) {
        cout << 1 << endl;
        return 0;
    }

    int masu[N + 1] {0};
    masu[1] = 1;
    //cout << count_bit(N) << endl;

    int cur = 1;
    int step = 1;
    int changed = true;
    for (;changed; step++) {
        //output(N, masu);
        changed = false;
        for (int i = 1; i < N; i++) {
            if (masu[i] == step) {
                int reach = count_bit(i);
                if (i - reach > 0 && (masu[i - reach] == 0 || step < masu[i - reach] - 1)) {
                    masu[i - reach] = step + 1;
                    changed = true;
                }
                if (i + reach < N && (masu[i + reach] == 0 || step < masu[i + reach] - 1)) {
                    masu[i + reach] = step + 1;
                    changed = true;
                }
                else if (i + reach == N) {
                    cout << step + 1 << endl;
                    return 0;
                }

            }
        }
    }

    cout << -1 << endl;
    return 0;
}