#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <numeric>
#include <cstring>
#include <cmath>
#include <set>
#include <queue>
#include <stack>

const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
#define rep(i, n) for (int i = 0; i < (n); i++)

using namespace std;
using ll = long long int;
using P = pair<int, int>;
using edge = struct
{
    int to;
    int cost;
};

int cnt[10010];
bool flag[10010];

int bitcnt(int now)
{
    int ans = 0;
    while (now > 0)
    {
        if (now % 2 == 1)
            ans++;
        now /= 2;
    }

    return ans;
}

int main()
{
    rep(i, 10010) cnt[i] = iINF;
    cnt[1] = 1;

    int N;
    cin >> N;
    queue<int> que;
    que.push(1);
    while(!que.empty())
    {
        int now = que.front(); que.pop();
        if(flag[now]) continue;
        int d = bitcnt(now);

        if(1 <= now - d && now - d <= N && cnt[now - d] == iINF)
        {
            cnt[now - d] = min(cnt[now] + 1, cnt[now - d]);
            que.push(now - d);
        }

        
        if(1 <= now + d && now + d <= N && cnt[now + d] == iINF)
        {
            cnt[now + d] = min(cnt[now] + 1, cnt[now + d]);
            que.push(now + d);
        }
    }

    cout << (cnt[N] != iINF ? cnt[N] : -1) << endl;
      
    return 0;
}