#include <iostream>
#include <sstream>
#include <math.h>
#include <stack>
#include <set>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <vector>
#include <bitset>
using namespace std;

#define INF (1 << 30)
#define INFLL (1LL << 60)

int ido[10010] = {},n;

int bit_how(int n){
	stringstream ss;
	ss << bitset<32>(n);
	int ans = 0;
	for(int i = 0;i < ss.str().size();i++){
		if(ss.str()[i] == '1') ans++;
	}
	return ans;
}

int memo[10010] = {};

int saiki(int now,int how){
	if(memo[now] < how) return INF;
	if(now > n) return INF;
	if(now == n) return how;
	int a,b;
	memo[now] = how;
	a = saiki(now + ido[now],how+1);
	b = saiki(now - ido[now],how+1);
	return min(a,b);
}

int main() {
	int how;
	for(int i = 0;i < 10010;i++) memo[i] = INF;
	for(int i = 0;i < 10010;i++){
		ido[i] = bit_how(i);
	}
	cin >> n;
	int ans = saiki(1,1);
	if(ans == INF) cout << "-1" << endl;
	else cout << ans << endl;
	return 0;
}