#include <stdio.h>
#include <ctype.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>

#define INF 1000000

using namespace std;

int is_reachable(int idx, vector<int> squares, vector<int> footprint)
{
    if (any_of(footprint.begin(), footprint.end(), [idx](int x) { return x == idx; }))
    {
        /*
        for (auto p : footprint)
        {
            printf("%d->", p);
        }

        printf("%d", idx);
        */

        return INF;
    }

    footprint.push_back(idx);

    if (idx == 0)
    {
        return 1;
    }

    int fastest = INF;

    for (int i = 0; i < squares.size(); i++)
    {
        if (i + squares[i] == idx || i - squares[i] == idx)
        {
            int route = 1 + is_reachable(i, squares, footprint);

            if (route < fastest)
            {
                fastest = route;
            }
        }
    }

    return fastest;
}

int main()
{
    int n;
    scanf("%d", &n);

    vector<int> squares(n, 0);

    for (int i = 0; i < n; i++)
    {
        unsigned int v = i + 1;
        unsigned int c;

        for (c = 0; v; v >>= 1)
        {
            c += v & 1;
        }

        squares[i] = c;
    }

    vector<int> footprint{};
    int answer = is_reachable(n - 1, squares, footprint);

    if (answer >= INF)
    {
        printf("-1");
    }
    else
    {
        printf("%d", answer);
    }
}