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

using namespace std;
using LL = long long;

constexpr LL INF = 1L << 60;
int sugoroku[10001];

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

    for (int i = 1; i <= N; i++) {
        if (sugoroku[i] == 0) {
            sugoroku[i] = sugoroku[i - 1] + 1;
            for (int j = i * 2; j <= N; j *= 2) {
                sugoroku[j] = sugoroku[i];
            }
        }
    }

    vector<int> G[N + 1];
    for (int i = 1; i <= N - 1; i++) {
        if (i + sugoroku[i] <= N) G[i].push_back(i + sugoroku[i]);
        if (i - sugoroku[i] >= 1) G[i].push_back(i - sugoroku[i]);
    }

    LL ans = INF;
    queue<pair<int, int>> que;

    que.emplace(1, 1);
    sugoroku[1] = 0;
    while (!que.empty()) {
        auto p = que.front();
        que.pop();
        if (p.first == N) {
            ans = p.second;
            break;
        }
        for (int q: G[p.first]) {
            if (sugoroku[q]) {
                que.emplace(q, p.second + 1);
                sugoroku[q] = 0;
            }
        }
    }

    cout << (ans != INF ? ans : -1) << endl;
}