#include <iostream>
#include <queue>

using namespace std;

const int MAX = 10000;

int BitCount(int number,int serch_bitnum){
	int counter = 0;
	for(int i = 0; i < serch_bitnum; i++)if(number & (1 << i))counter++;
	return counter;
}

bool Found(int *meta,int data){
	return meta[data] != 0;
}

int main(){

	int N;
	queue<int> que;
	int cellcounter[MAX] = {0};
	int cellcount = -1;
	int cell = -1;
	int step = -1;

	cin >> N;

	que.push(1);
	cellcounter[1] = 1;
	cellcount = 0;

	do{
		cell = que.front();
		que.pop();
		step = BitCount(cell,16);

		cellcount = cellcounter[cell];		

		if(!Found(cellcounter,cell+step) && cell+step < N+1){
			que.push(cell+step);
			cellcounter[cell+step] = cellcount+1;
		}

		if(!Found(cellcounter,cell-step) && cell-step > 0){
			que.push(cell-step);
			cellcounter[cell-step] = cellcount+1;
		}
		

	}while(!que.empty());

	cout << (cellcounter[N] ? cellcounter[N] : -1) << endl;

	return 0;
}