#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
#include <bitset>
using namespace std;

#define FOR(i, s, e) for (int i = (s); i <= (e); i++)

typedef unsigned int uint;

typedef pair<vector<int>, int> P;

vector<int> es[10001];
vector<bool> visited(10001, false);

int N;

int main()
{
    cin >> N;
    FOR(i, 1, N)
    {
        unsigned int x = i;
        int cou = 0;
        while (x != 0)
        {
            if (x % 2 == 1)
                cou++;
            x >>= 1;
        }
        if (i + cou <= N)
        {
            es[i].push_back(i + cou);
        }
        if (i - cou >= 1)
        {
            es[i].push_back(i - cou);
        }
    }

    queue<int> q;
    q.push(1);
    for (int c = 1; c <= N; c++)
    {
        int siz = q.size();
        for(int j = 0;j < siz;j++)
        {
            int x = q.front();
            if (x == N)
            {
                cout << c << endl;
                return 0;
            }
            q.pop();
            FOR(i, 0, es[x].size() - 1)
            {
                if (visited[es[x][i]] == false)
                {
                    q.push(es[x][i]);
                    visited[es[x][i]] = true;
                }
            }
        }
    }
    cout << -1 << endl;
    return 0;
}