#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
int d[1 << 14];
vector<int> G[1 << 14];
int main(){
	fill(d, d + (1 << 14), (int)mod); d[1] = 1;
	int n; cin >> n;
	rep1(i, n) {
		int c = 0; int x = i;
		while (x) {
			if (x % 2)c++;
			x >>= 1;
		}
		if (i + c <= n)G[i].push_back(i + c);
		if (i - c > 0)G[i].push_back(i - c);
	}
	priority_queue<P> q; q.push({ 1,1 });
	while (!q.empty()) {
		P x = q.top(); q.pop();
		rep(j, (int)G[x.second].size()) {
			if (d[G[x.second][j]] > x.first + 1) {
				d[G[x.second][j]] = x.first + 1;
				q.push({ x.first + 1,G[x.second][j] });
			}
		}
	}
	if (d[n] == (int)mod)cout << -1 << endl;
	else cout << d[n] << endl;
	return 0;
}