#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int numOfBits(int n){
	int bits=0;
	do{
		bits += n %2;
		n /= 2;
	}while(n>0);
	
	return bits;
}

void sugoroku(int a[],int n,int position,int turn){
	a[position]=turn;
	int bit_cnt = numOfBits(position);
	if(position-bit_cnt>0){
		if(a[position-bit_cnt]==-1){
			sugoroku(a,n,position-bit_cnt,turn+1);
		}
	}
	
	if(position+bit_cnt<n+1){
		if(a[position+bit_cnt]==-1){
			sugoroku(a,n,position+bit_cnt,turn+1);
		}
	}
	
}

int main(){
	int n;
	scanf("%d",&n);
	
	int a[n+1];
	int i;
	for(i=0;i<n+1;i++){
		a[i]=-1;
	}
	
	sugoroku(a,n,1,1);
	
	printf("%d\n",a[n]);
	
	return 0;
}