//--------------------------------------------------template----------------------------------------//
//c
#include <stdio.h>
#include <time.h>
#include <math.h>
//c++
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <complex>
#include <cmath>
//c++11
#include <tuple>
#define all(c) ((c).begin(),(c).end())
#define rall(c) (c).rbegin(),(c).rend()
//#define sort(v,n) sort(v,v+n)
//#define vsort(v) sort(v.begin(),v.end())
//#define vvsort(v) sort(v.begin(),v.end(),greater<int>())
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
#define inf 999999999
using namespace std;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
//---------------------------------------------------------------------------------------------//
inline int contbit(int a) {
	int res = 0;
	while (a) {
		if (a & 1)res++;
		a >>= 1;
	}
	return res;
}
int n;
int ans = inf;
bool b[10001];
inline void bfs() {
	queue<pair<int,int>> q;
	q.push(pair<int,int>(1,1));
	b[1] = 1;
	while (!q.empty()) {
		int now = q.front().first;
		int nowcont = q.front().second;
		q.pop();
		b[now] = 1;
		if (now == n) { ans = min(ans, nowcont); break; }
		int m = contbit(now);
		if (now + m <= n && b[now+m]==0 )q.push(pair<int, int>(now + m, nowcont+1));
		if (now - m > 0 && b[now-m]==0)q.push(pair<int, int>(now - m, nowcont+1));
	}
}

int main() {
	cin >> n;
	bfs();
	if (ans!=inf) {
		cout << ans << endl;
	}
	else {
		cout << -1 << endl;
	}
}