#include <iostream>
#include <algorithm>
#include <bit>
int n[10000];
int main(){
	int N;
	std::cin>>N;
	n[0]=1;
	for(int i=1;i<=N;i++){
		for(unsigned j=0;j<N;j++){
			if(n[j]==i){
				int p=std::popcount(j+1);
				if(j>=p&&n[j-p]==0)n[j-p]=i+1;
				if(j+p<N&&n[j+p]==0)n[j+p]=i+1;
			}
		}
	}
	std::cout<<n[N-1]-1;
}