#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <climits>
#include <bitset>
#include <cassert>
#include <random>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n;
	cin >> n;

	vector<int> dist(n+1, -1);
	dist[1] = 1;

	queue<int> q;
	q.push(1);
	while (!q.empty()){
		int pos = q.front();
		q.pop();

		int cnt = 0;
		rep(i, 30) cnt += pos >> i & 1;

		for (auto e : { -1, 1 }){
			int nxt = pos + e*cnt;
			if (nxt <= 0 || nxt > n) continue;
			if (dist[nxt] >= 0) continue;
			dist[nxt] = dist[pos] + 1;
			q.push(nxt);
		}
	}

	cout << dist[n] << endl;


	return 0;
}