#include <bits/stdc++.h>
using namespace std;

int N;
vector<int> bit(10001, 0);
vector<int> dp(10001, -1);
int result = INT_MAX;

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

void rec(int count = 1, int corrent = 1){
    
    if(corrent < 1) return;
    if(corrent > N) return;
    if(corrent == N){
        result = min(result, count);
        return;
    }
    
    if(~dp[corrent] && dp[corrent] <= count) return;
    dp[corrent] = count;
    
    rec(count + 1, corrent + bit[corrent]);
    rec(count + 1, corrent - bit[corrent]);
    
    return;
}

int main(void){
    
    cin >> N;
    for(int i = 1; i <= N; ++i) bit[i] = Count(i);
    
    rec();
    if(result == INT_MAX) cout << -1 << endl;
    else cout << result << endl;
    
    return 0;
}