import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;

public class Yuki003 {
    int bitCount(int value) {
        int count = 0;
        while (value > 0) {
            count += value % 2;

            value /= 2;
        }
        return count;
    }

    Yuki003() {
        Scanner scanner = new Scanner(System.in);

        int N = scanner.nextInt();

        System.out.println(search(N));


    }

    private int search(final int N) {
        boolean[] visit = new boolean[N + 1];
        ArrayList<Integer> list = new ArrayList<>();
        ArrayList<Integer> next = new ArrayList<>();
        list.add(1);
        int move = 1;
        visit[1] = true;
        while (list.size() > 0) {
            for (int i = 0; i < list.size(); i++) {
                final Integer value = list.get(i);
                if (value == N) {
                    return move;
                }
                visit[value] = true;

                int bit = bitCount(value);
                int prev = value - bit;
                int nxt = value + bit;
                if (1 <= prev && !visit[prev]) {
                    next.add(prev);
                }
                if (nxt <= N && !visit[nxt]) {
                    next.add(nxt);
                }

            }
            list.clear();
            list.addAll(next);
            next.clear();
            move++;
        }
        return -1;
    }

    public static void main(String[] args) {
        new Yuki003();

    }
}