#include<iostream>
#include<math.h>
#include<vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>
#include <bitset>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define ITR(it, a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int n, m;
int dp(int s, int e, vector<int> stack) {
    if (s==e) return 0;
    int min_ = 1e9;
    bitset<32> bs(s);
    int diff = bs.count();
    REP(i, 2) {
        int next = s + diff * (-1 + i*2);
        if (next < 1 || n < next) continue;
        if (CONTAIN(stack, next)) continue;
        stack.push_back(next);
        min_ = min(min_, 1+dp(next,e,stack));
    }
    return min_;
}

signed main()
{
    cin >> n;

    vector<int> stack;
    int ret = 1 + dp(1, n, stack);
    cout << ((ret >= 1e9)?-1:ret) << endl;

    return 0;
}