#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <complex>
#include <string.h>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

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

const int inf = 1000000009;

int bitcount(int x) {
    int ret = 0;
    while (x) {
	x &= x - 1;
	ret++;
    }
    return ret;
}

const int MAX = 10010;
struct edge {
    int to, cost;
};

int V;
vector<edge> G[MAX];
int d[MAX];

void dijkstra(int s) {
    priority_queue<P, vector<P>, greater<P> > que;
    fill(d, d+V, inf);
    d[s] = 0;
    que.push(P(0, s));
    while (!que.empty()) {
	P p = que.top(); que.pop();
	int v = p.second;
	if (d[v] < p.first) continue;
	for (int i = 0; i < G[v].size(); i++) {
	    edge e = G[v][i];
	    if (d[e.to] > d[v] + e.cost) {
		d[e.to] = d[v] + e.cost;
		que.push(P(d[e.to], e.to));
	    }
	}
    }
}


int main() {
    int n;
    scanf("%d", &n);
    V = n + 1;
    for (int i = 1; i <= n; i++) {
	int c = bitcount(i);
	if (i - c >= 1) G[i].push_back(edge{i-c, 1});
	if (i + c <= n) G[i].push_back(edge{i+c, 1});
    }
    dijkstra(1);

    printf("%d\n", d[n] < inf ? d[n]+1 : -1);
}