import java.util.ArrayList;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		sc.close();
		int[] list = new int[N+10];
		int count = 1;
		int i=0;
		ArrayList<Integer> toDo = new ArrayList<Integer>();
		ArrayList<Integer> queue= new ArrayList<Integer>();
		toDo.add(1);
		list[1] = 1;
		while(i<1){
			toDo.addAll(queue);
			queue.clear();
			count+= 1;
			for(int searchNum : toDo){
				String two = Integer.toBinaryString(searchNum);
				two = two.replace("0", "");
				int change = two.length();
				if(searchNum-change>0){
					if(list[searchNum-change]==0){
						list[searchNum-change]=count;
						queue.add(searchNum-change);
					}else{
						list[searchNum-change]=Math.min(list[searchNum-change], count);
					}
				}
				if(searchNum+change<=N){
					if(list[searchNum+change]==0){
						list[searchNum+change]=count;
						queue.add(searchNum+change);
					}else{
						list[searchNum+change]=Math.min(list[searchNum+change], count);
					}
				}
				if(list[N]!=0){
					break;
				}

			}
			toDo.clear();
			if(list[N]!=0){
				System.out.println(list[N]);
				i+=1;
				break;
			}
			if(queue.isEmpty()&&toDo.isEmpty()){
				System.out.println(-1);
				i+=1;
				break;
			}

		}

 	}// mainmethod

} // class