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

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

    std::vector<bool> non_visited(N + 1, true);
    const int INF = 10001;
    std::vector<int> cnt(N + 1, INF);
    std::vector<int> next_dist(N + 1);
    for (int i = 1; i < N + 1; i++) {
        std::bitset<32> bs(i);
        next_dist.at(i) = bs.count();
    }
    std::queue<int> q;
    q.push(1);
    non_visited.at(1) = false;
    cnt.at(1) = 1;
    while (!q.empty()) {
        int x = q.front();
        if (x == N) {
            break;
        }
        q.pop();
        for (auto &y: {x + next_dist.at(x), x - next_dist.at(x)}) {
            if (y <= 0 || N < y) {
                continue;
            }
            if (non_visited.at(y)) {
                q.push(y);
                non_visited.at(y) = false;
                cnt.at(y) = cnt.at(x) + 1;
            }
        }
    }
    int ans = (cnt.at(N) != INF) ? cnt.at(N) : -1;
    std::cout << ans << std::endl;
}