#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000

int visit[10010];
int N;

void dfs(int x, int depth) {
	//cout << x << endl;
	visit[x] = min(visit[x] ,depth);
	int tmp = x;
	int bit = 0;
	while (tmp > 0) {
		if (tmp % 2 == 1) bit++;
		tmp /= 2;
	}
	int front = x + bit;
	int back = x - bit;
	if (front <= N && depth + 1 <= visit[front] ) {
		dfs(front, depth + 1);
	}
	if (1 <= back && depth + 1 <= visit[back]) {
		dfs(back, depth + 1);
	}

}


int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
	cin >> N;
	rep(i, 10010) visit[i] = 100000;
	dfs(1, 1);
	if (visit[N] == 100000) {
		cout << -1 << endl;
		return 0;
	}
	cout << visit[N] << endl;


    return 0;
}