#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <sstream>
#include <functional>
#include <ctime>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n)  FOR(i,0,n)
#define CLEAR(d) memset((d), 0, (sizeof((d))))
#define ALL(c) (c).begin(), (c).end()
#define ABS(x) ((x < 0) ? -(x) : (x))
#define SORT(x) sort((x).begin(), (x).end())
#define RSORT(x) sort((x).begin(), (x).end(), greater<int>() )
#define SIZE(a) ((int)((a).size()))
#define MAX3(a, b, c) (max(max((a), (b)), (c)))
#define MIN3(a, b, c) (min(min((a), (b)), (c)))
#define MOD 1000000007
#define EPS 1e-5
#define PI  (acos(-1))
#define INF 10000000
//===================================================
int arr[10001];
int num[10001];
int main()
{
    int n;
    cin >> n;
    REP(i, 10001) arr[i] = INF;
    for (int i = 1; i <= 10000; i++) {
        int s = i, bs = 0;
        while (s > 0) {
            bs += (s & 1 == 1) ? 1 : 0;
            s /= 2;
            if (num[s] != 0) { bs += num[s]; break; }
        }
        num[i] = bs;
    }
    queue<int> q;
    q.push(1);
    arr[1] = 1;
    while (!q.empty()) {
        int now = q.front(); q.pop();
        if (now - num[now] >= 1 && arr[now - num[now]] == INF) {
            arr[now - num[now]] = arr[now] + 1;
            q.push(now - num[now]);
        }
        if (now + num[now] <= n && arr[now + num[now]] == INF) {
            arr[now + num[now]] = arr[now] + 1;
            q.push(now + num[now]);
        }
    }
    printf("%d\n", (arr[n] == INF) ? -1 : arr[n]);
    return 0;
}