#include <stdio.h>

int N;
int flags[10000];

int bits(int position) {
    int b = 0;
    while (position > 0) {
        if ((position&1) > 0)
            b++;
        position = position >> 1;
    }
    return b;
}

int move(int position, int step) {
    int b = bits(position);
    int fpos = -1, bpos = -1;
    
    if (position+b == N)
        return step+1;

    if (position+b < N)
        fpos = move(position+b, step+1);
    if (position-b > 0)
        bpos = move(position-b, step+1);
    
    if (fpos == -1) {
        return bpos;
    } else {
        if (bpos == -1)
            return fpos;
        else if (fpos < bpos)
            return fpos;
        else
            return bpos;
    }
}
main() {
    scanf("%d", &N);
    
    for (int i=0; i<10000; i++)
        flags[i] = 0;
    
    int result = move(1, 0);
    
    printf("%d\n", result);
}