#include <iostream>
#include <utility>
#include <queue>
#include <set>

typedef std::pair<int, int> Grid;
typedef std::queue<Grid> GridQueue;

int getOneBitNumber(int n) {
    int count = 0;
    while (n > 0) {
        if (n % 2 == 1) {
            count++;
        }
        n = n / 2;
    }
    return count;
}

int solve(GridQueue& grid_queue, int n) {
    std::set<int> memo;

    while (!grid_queue.empty()) {
        auto tmp_grid = grid_queue.front(); grid_queue.pop();
        if (tmp_grid.first == n) return tmp_grid.second;
        memo.insert(tmp_grid.first);
        int moving_grid = getOneBitNumber(tmp_grid.first);
        int moved_grid[2] = {tmp_grid.first-moving_grid, tmp_grid.first+moving_grid};
        for (int i = 0; i < 2; i++) {
            if (moved_grid[i] > 0 && moved_grid[i] < n+1) {
                bool gone_flag = false;
                for (auto memo_list : memo) {
                    if (memo_list == moved_grid[i]) {
                        gone_flag = true;
                        break;
                    }
                }
                if (!gone_flag) {
                    Grid new_grid(moved_grid[i], tmp_grid.second+1);
                    grid_queue.push(new_grid);
                }
            }
        }
    }

    return -1;
}

int main(int argc, char const* argv[]) {
    int N;
    Grid grid(1, 1);
    GridQueue grid_queue;
    grid_queue.push(grid);

    std::cin >> N;

    int ans = solve(grid_queue, N);
    std::cout << ans << std::endl;
    return 0;
}