#include <bits/stdc++.h>
#define FI(i,a,b) for(int i=(a);i<=(b);i++)
#define FD(i,b,a) for(int i=(b);i>=(a);i--)
#define len(a) int((a).size())
using namespace std;
using LL = long long;
using PII = pair<int, int>;


const int N = 10005;
int F[N];

int dfs(int x, int target, bitset<N> b) {
    if (F[x] != -1) return F[x];
    if (x == target) return F[x] = 0;
    b.set(x);
    int t = __builtin_popcount(x);
    int ans = 1 << 30;
    if (x > t && !b.test(x-t)) {
        ans = 1 + dfs(x-t, target, b);
    }
    if (x + t <= target && !b.test(x+t)) {
        ans = min(ans, 1 + dfs(x+t, target, b));
    }
    return F[x] = ans;
}

int main() {
    int n;
    scanf("%d", &n);
    memset(F, -1, sizeof F);
    bitset<N> b(0);
    int ans = dfs(1, n, b) + 1;
    if (ans >= 1 << 30) ans = -1;
    printf("%d\n", ans);
}