// Enjoy your stay.

#include <bits/stdc++.h>

#define long long long
#define LOOPVAR_TYPE long

#define all(x) (x).begin(), (x).end()
#define sz(x) ((LOOPVAR_TYPE)(x).size())
#define foreach(it, X) for(__typeof((X).begin()) it = (X).begin(); it != (X).end(); it++)
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(LOOPVAR_TYPE i = (LOOPVAR_TYPE)(a); i < (LOOPVAR_TYPE)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)

#define fir first
#define sec second
#define mp make_pair
#define mt make_tuple
#define pb push_back

const double EPS = 1e-9;
const double PI = acos(-1.0);
const long INF = 1070000000LL;
const long MOD = 1000000007LL;

using namespace std;

typedef istringstream iss;
typedef stringstream sst;
typedef pair<LOOPVAR_TYPE, LOOPVAR_TYPE> pi;
typedef vector<LOOPVAR_TYPE> vi;



int main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	
	int N;
	cin>>N;
	queue<int> Q;
	int dist[10010];
	fill(dist,dist+N+1,INF);
	dist[1] = 0;
	Q.push(1);
	while(sz(Q)){
		int cur = Q.front();
		Q.pop();
		for(int dir = -1; dir <= 1; dir += 2){
			int nx = cur + __builtin_popcount(cur) * dir;
			if(1 <= nx && nx <= N && dist[nx] == INF){
				dist[nx] = dist[cur] + 1;
				Q.push(nx);
			}
		}
	}
	cout<<(dist[N] == INF ? -1 : dist[N] + 1)<<endl;
}