#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-12;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;

int count(int data)
{
    int res = 0;
    for (; data; data &= data - 1)
    {
        res++;
    }
    return res;
}

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

    int n;
    cin >> n;
    vector<int> dp(n + 1, INF);
    queue<int> q;
    dp[1] = 1;
    q.push(1);
    while (!q.empty())
    {
        int v = q.front();
        q.pop();
        int cnt = count(v);
        if (v - cnt >= 1)
        {
            if (dp[v - cnt] == INF)
            {
                dp[v - cnt] = dp[v] + 1;
                q.push(v - cnt);
            }
        }
        if (v + cnt <= n)
        {
            if (dp[v + cnt] == INF)
            {
                dp[v + cnt] = dp[v] + 1;
                q.push(v + cnt);
            }
        }
    }
    if (dp[n] == INF)
        cout << -1 << endl;
    else
        cout << dp[n] << endl;
}