#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>

int calc( int x )
{
    if ( x < 2 ) {
        return x;
    } else {
        return ( x % 2 ) + calc( x >> 1 );
    }
}

int main()
{
    // input
    int N;
    scanf( "%d", &N );

    // process
    int cost[10000];
    for ( int i=0; i<N; i++ ) {
        cost[i] = -1;
    }
    std::queue<int> q_state;
    q_state.push(1);
    cost[0] = 1;
    while ( not q_state.empty() ) {
        int cur = q_state.front();
        q_state.pop();
        int step = calc( cur );
        int cur_back = cur - step;
        if ( cur_back > 0 && cur_back <=N ) {
            if ( cost[cur_back-1] == -1 or cost[cur_back-1] > cost[cur-1] + 1 ) {
                cost[cur_back-1] = cost[cur-1] + 1;
                q_state.push(cur_back);
            }
        }
        int cur_forw = cur + step;
        if ( cur_forw > 0 && cur_forw <=N ) {
            if ( cost[cur_forw-1] == -1 or cost[cur_forw-1] > cost[cur-1] + 1 ) {
                cost[cur_forw-1] = cost[cur-1] + 1;
                q_state.push(cur_forw);
            }
        }
    }

    // output
    printf( "%d\n", cost[N-1] );

    return 0;
}