#include <iostream>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <cmath>

using namespace std;

#define FOR(x,y) for(int x = 0;x < y;x++)
#define LLI long long int

template<int um> class UF {
public:
    vector<int> par,rank,cnt;
    UF() {par=rank=vector<int>(um,0); cnt=vector<int>(um,1); for(int i=0;i<um;i++) par[i]=i;}
    void reinit() {FOR(i,um) rank[i]=0,cnt[i]=1,par[i]=i;}
    int operator[](int x) {return (par[x]==x)?(x):(par[x] = operator[](par[x]));}
    int count(int x) { return cnt[operator[](x)];}
    int operator()(int x,int y) {
        if((x=operator[](x))==(y=operator[](y))) return x;
        cnt[y]=cnt[x]=cnt[x]+cnt[y];
        if(rank[x]>rank[y]) return par[x]=y;
        rank[x]+=rank[x]==rank[y]; return par[y]=x;
    }
};

static int CountBit(unsigned int i, vector<int>& memo)
{
    if(memo[i] != -1)
    {
        return memo[i];
    }
    int count = 0;
    while(i > 0)
    {
        if((i & 1) == 1)
        {
            count++;
        }
        i >>= 1;
    }
    memo[i] = count;
    return count;
}

int main() {
    int n;
    cin >> n;
    queue<int> buffer;
    vector<bool> visited(n + 1);
    vector<int> memo(n + 1);
    buffer.push(1);
    FOR(i, n + 1)
    {
        visited[i] = false;
        memo[i] = -1;
    }
    visited[1] = true;
    if(n == 1)
    {
        cout << 1 << endl;
        return 0;
    }
    int count = 1;
    while(!buffer.empty())
    {
        queue<int> next;
        count++;
        while(!buffer.empty())
        {
            int top = buffer.front();
            buffer.pop();
            int bits = CountBit(top, memo);
            int plus = top + bits;
            if(plus == n)
            {
                cout << count << endl;
                return 0;
            }
            if(plus >= 1 && plus <= n)
            {
                if(!visited[plus])
                {
                    next.push(plus);
                    visited[plus]=true;
                }
            }
            int minus = top - bits;
            if(minus >= 1 && minus <= n)
            {
                if(!visited[minus])
                {
                    next.push(minus);
                    visited[minus]=true;
                }
            }
        }
        buffer = next;
    }
    cout << -1 << endl;
    return 0;
}