import java.util.ArrayDeque;
import java.util.Scanner;

public class No3 {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		
		int N = Integer.parseInt(scanner.next());
		
		scanner.close();
		
		int[] mass = new int[N+1];
		
		mass[1] = 1;
		int i = 1,bit = 0;
		
		ArrayDeque<Integer> arrayDeque = new ArrayDeque<>();
		arrayDeque.add(1);
		
		while(!arrayDeque.isEmpty()) {
			i= arrayDeque.pop();
			
			bit = Integer.bitCount(i);
			
			if(mass[i] == 0) {
				continue;
			}
			
			if(mass[i-bit] > mass[i]+ 1 || mass[i-bit]== 0 ) {
				mass[i-bit] = mass[i] + 1;
				arrayDeque.add(i-bit);
			}
			
			if(i+bit > N) {
				continue;
			}else if(mass[i+bit] > mass[i] + 1 || mass[i+bit] == 0) {
				mass[i+bit]= mass[i] + 1;
				arrayDeque.add(i+bit);
			}
		}
		
		if(mass[N] == 0) {
			mass[N] = -1;
		}
		
		System.out.println(mass[N]);
	}

}