import java.util.*;
import java.lang.*;
import java.io.*;

class Main {
    public static int getRange(int n, int acc){
        if(n==0){return acc;}
        else{return getRange(n/2, acc+(n%2));}
    }
    public static List<Integer> canReachTo(int max, int goal){
        List<Integer> ls = new ArrayList<Integer>();
        for(int i=1; i <= max; i++){
            int r = getRange(i, 0);
            if(i==goal+r && i <= max){ls.add(i);}
            if(i==goal-r && 1 <= i){ls.add(i);}
        }
        return ls;
    }
    public static int minPathTo(int max, int goal, int acc){
        List<Integer> ls = canReachTo(max, goal);
        List<Integer> temp = new ArrayList<Integer>();
        if(goal == 1){return acc;}
        for(Integer i : ls){
            int j = minPathTo(max, i.intValue(), acc+1);
            if(j != -1) { temp.add(j); }
        }
        if(temp.size() <= 0){return -1;}
        else{
            return Collections.min(temp);
        }
    }
    public static void main (String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        System.out.println(minPathTo(n, n, 0));
    }
}