import java.util.*;

public class Main {
	
	
  public static void main(String[] args) {
	  Scanner sc=new Scanner(System.in);
	  int n=sc.nextInt();
	  int dp[]=new int[n+1];
	  Arrays.fill(dp,-1);
	  dp[1]=1;
	  Queue <conect>next=new PriorityQueue<>();
	  next.add(new conect(1,1));
	  while(!next.isEmpty()){
		  conect c=next.poll();
		  int bit=Integer.bitCount(c.num);
		  int to=c.num-bit;
		  int j=0;
		  while(j<2){
		  if((to>0 && to<=n) && (dp[to]>dp[c.num]+1 || dp[to]==-1)){
			  dp[to]=dp[c.num]+1;
			  next.add(new conect(dp[to],to));
		  }
		  to=c.num+bit;
		  j++;
		  }
	  }
	  System.out.println(dp[n]);
  }
}

class conect implements Comparable<conect> {
	int dp;
	int num;

	public conect(int dp, int num) {
		this.dp = dp;
		this.num = num;
	}

	public conect() {
	}

	@Override
	public int compareTo(conect o) {
		return this.num - o.num;
	}

}