/*
g++ -std=c++11 -Wall -O2 -o main.exe main.cpp
./main.exe
*/

#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <climits>
//intの最大値: INT_MAX
//longの最大値: LONG_MAX
//long longの最大値: LLONG_MAX
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <map>
#include <functional>
#include <algorithm>
#include <complex>
#include <numeric>
#include <queue>
#include <stack>
//最大公約数: gcd()
//最小公倍数: lcm()

#define ll long long int

using namespace std;

template <typename T>
void sortasc(vector<T> &v){ //vectorを昇順にソート
    sort(v.begin(), v.end(), std::less<T>());
    return;
}

template <typename T>
void sortdesc(vector<T> &v){ //vectorを降順にソート
    sort(v.begin(), v.end(), std::greater<T>());
    return;
}

//------------------------------------------------------------------------------

queue<int> q;

int main(){
	int n;
	cin >> n;

	int c = 1, temp = 1, count = 0;
	vector<int> d(n + 1);
	d[1] = 1;

	while(c != n){

		while(temp){
			if(temp % 2 == 1) count++;
			temp /= 2;
		}

		int v1 = c + count, v2 = c - count;
		if(v1 <= n && d[v1] == 0){
			q.push(v1);
			d[v1] = d[c] + 1;
		}
		if(v2 > 0 && d[v2] == 0){
			q.push(v2);
			d[v2] = d[c] + 1;
		}
		count = 0;

		if(q.size() == 0){
			cout << -1 << endl;
			return 0;
		}

		c = temp = q.front();
		q.pop();
		
	}

	cout << d[c] << endl;
	return 0;
}