#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}







int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   

    while (Q--) {
        vector<int>c(10101);
        for (int i = 1; i < 10100; i++) {
            int x = i;
            
            while (x) {
                if (x % 2)c[i]++;
                x /= 2;
               
            }

        }
        
        int n;
        cin >> n;
        vector<int>f(n + 10100,1e9);
        f[1] = 1;
        for (int i = 1; i <= n; i++) {
            if(f[i])f[i + c[i]] = min(f[i]+1,f[i+c[i]]);
            
        }
       // cout << f[2] << " " << f[3] << " " << f[4] << " " << f[5] << endl;;
        for (int i = n; i > 0; i--) {
            if (f[i] && i - c[i] > 0)f[i - c[i]] = min(f[i] + 1, f[i - c[i]]);
        }
       // cout << f[2] << " " << f[3] << " " << f[4] << " " << f[5] << endl;;
        for (int i = 1; i <= n; i++) {
            if (f[i])f[i + c[i]] = min(f[i] + 1, f[i + c[i]]);
        }
        for (int i = n; i > 0; i--) {
            if (f[i] && i - c[i] > 0)f[i - c[i]] = min(f[i] + 1, f[i - c[i]]);
        }
       // cout << f[2] << " " << f[3] << " " << f[4] << " " << f[5];

        if (f[n]!=1e9)cout << f[n];
        else cout << -1;
      
    }
        return 0;
}