#include <vector>
#include <queue>
#include "iostream"
#include "algorithm"
using namespace std;

#define MAX 9999999

int bitcount(int a) {
    int ret = 0;
    while (a > 0) {
        ret++;
        a &= a - 1;
    }
    return ret;
}

int main() {
    int n;
    cin>>n;
    vector<int> dp(n + 1, MAX);
    queue<int> q;
    dp[1] = 1;
    q.push(1);
    while (!q.empty()) {
        int current = q.front(); q.pop();
        int diff = bitcount(current);
        for (int i = -diff; i <= diff ; i += diff*2) {
            if (current+i < 1 || current+i > n || dp[current+i]!=MAX) continue;
            dp[current + i] = dp[current] + 1;
            q.push(current + i);
        }
    }

    if (dp[n] == MAX) cout<<-1<<endl;
    else cout<<dp[n]<<endl;

    return 0;
}