#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

#define INF (100000)

int count(int n) {
	int res = 0;
	while (n > 0) {
		if (n % 2 == 1) ++res;
		n /= 2;
	}
	return res;
}

int v[10001];

int main(int argc, char **argv) {
	int N;
	cin >> N;
	REP(i, N + 1) v[i] = INF;
	queue<int> q;
	q.push(1);
	v[1] = 1;
	while (v[N] >= INF && !q.empty()) {
		int m = q.front(); q.pop();
		int c = count(m);
		if (m - c >= 1 && v[m - c] > v[m] + 1) {
			v[m - c] = v[m] + 1;
			q.push(m - c);
		}
		if (m + c <= N && v[m + c] > v[m] + 1) {
			v[m + c] = v[m] + 1;
			q.push(m + c);
		}
	}
	if (v[N] >= INF) v[N] = -1;
	cout << v[N] << endl;
	return 0;
}