#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <stack>
#include <array>
#include <fstream>

#define REP(i,n) for(int (i) = 0;(i) < (n) ; ++(i))
#define REPA(a,i,n) for(int (i) = (a) ; (i) < (n) ; ++(i))
#if defined(_MSC_VER)||__cplusplus > 199711L
#define AUTO(r,v) auto r = (v)
#else
#define AUTO(r,v) typeof(v) r = (v)
#endif
#define ALL(c) (c).begin() , (c).end()
#define EACH(it,c) for(AUTO(it,(c).begin());it != (c).end();++it)
#define LL long long
#define int LL
#define INF  99999999
#define DEV 1000000007
#define QUICK_CIN ios::sync_with_stdio(false); cin.tie(0);
using namespace std;

int n;

bool ed[1000000];

signed main()
{
	QUICK_CIN;
	//ifstream cin("debug.txt");
	//ofstream cout("result.txt");

	cin >> n;

	queue<pair<int,int>> que;

	que.push(make_pair(1,1));
	ed[1] = true;

	while (!que.empty()){
		auto now = que.front();
		que.pop();

		if (now.first == n){
			cout << now.second << endl;
			return 0;
		}

		int temp = now.first;
		int num(0);

		while (temp){
			num += temp % 2;
			temp /= 2;
		}
		if (now.first + num <= n && !ed[now.first + num] ){
			ed[now.first + num] = true;

			que.push(make_pair(now.first + num, now.second + 1));
		}
		if (now.first - num > 0 && ed[now.first - num]){
			ed[now.first - num] = true;

			que.push(make_pair(now.first - num, now.second + 1));
		}
	}
	cout << -1 << endl;
}