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

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int main() {
    int n, p;
    int dp[10001];
    cin >> n;
    fill(dp,dp+n+1,INF);
    dp[1] = 1;
    p = 1;
    while (p < n) {
        int c = 0, num = p;
        while (num) {
            c += num % 2;
            num /= 2;
        }
        if (p-c > 0 && dp[p-c] > dp[p]+1) {
            dp[p-c] = dp[p]+1;
            p -= c;
        }
        else {
            if (p+c <= n)
                dp[p+c] = min(dp[p]+1,dp[p+c]);
            p++;
        }
    }
    if (dp[n] == INF)
        cout << -1 << endl;
    else
        cout << dp[n] << endl;
    return 0;
}