#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int,int> P;
 
const int INF = 1e9;
const int mod = 1e9+7;
const double EPS = 1e-10;
const double PI = acos(-1.0);
 
int dp[10010];
int cnt[10010];

int main()
{
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++) dp[i] = INF;
    for(int i = 1; i <= n; i++){
        int tmp = i;
        while(tmp){
            if(tmp&1) cnt[i]++;
            tmp /= 2;
        }
    } 
    dp[1] = 1;
    for(int j = 0; j < 100; j++){
        for(int i = 1; i <= n; i++){
            if(dp[i] != INF){
                if(i+cnt[i] <= n) dp[i+cnt[i]] = min(dp[i]+1,dp[i+cnt[i]]);
                if(i-cnt[i] > 0) dp[i-cnt[i]] = min(dp[i]+1,dp[i-cnt[i]]);
            }
        }
    }
    cout << (dp[n] != INF ? dp[n] : -1) << endl;
    return 0;
}