#include <bits/stdc++.h>
using namespace std;
typedef struct{ int corrent; int sum; }QUEUE;
bool operator> (const QUEUE &que1, const QUEUE &que2){ return que1.sum > que2.sum; }

int N;
vector<int> bit(10001, 0);
vector<int> dp(10001, -1);
priority_queue< QUEUE, vector<QUEUE>, greater<QUEUE> > que;

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

int main(void){
    
    cin >> N;
    for(int i = 1; i <= N; ++i) bit[i] = Count(i);

    QUEUE q = {1, 1};
    que.push(q);
    int result = 0;
    while(!que.empty()){
        q = que.top();
        que.pop();
        
        if(q.corrent == N){
            result = q.sum;
            break;
        }
        else if(q.corrent >= 1 && q.corrent <= N && (!(~dp[q.corrent]) || dp[q.corrent] > q.sum)){
            dp[q.corrent] = q.sum;
            QUEUE a;
            a.corrent = q.corrent + bit[q.corrent];
            a.sum = q.sum + 1;
            que.push(a);
            a.corrent = q.corrent - bit[q.corrent];
            que.push(a);
        }
        
    }
    
    if(result) cout << result << endl;
    else cout << -1 << endl;
    
    return 0;
}