#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#include<regex>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define pb push_back
#define eb emplace_back
using ll=long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
 
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
using namespace std;

void solve(){
    int n;
    cin>>n;
    int pre=1,nxt=1,cnt=1;
    bool dp[10020];
    dp[1]=true;
    for(int i=1;i<=n;++i){
        dp[i+__builtin_popcount(i)]|=dp[i];
    }
    for(int i=1;i<=n;++i){
        if(i-__builtin_popcount(i)>0)dp[i-__builtin_popcount(i)] |=dp[i];
    }
    for(int i=1;i<=n;++i){
        dp[i+__builtin_popcount(i)]|=dp[i];
    }
    if(!dp[n]){
        cout<<-1<<"\n";
    }
    else {
        while(nxt!=n){
        if(__builtin_popcount(pre)+pre<=n)nxt=__builtin_popcount(pre)+pre;
        else nxt=pre-__builtin_popcount(pre);
        pre=nxt;
        ++cnt;
    }
    cout<<cnt<<"\n";
    }
}
 
int main(){
	ios::sync_with_stdio(false);
    cin.tie(0);
	cout<<fixed<<setprecision(15);
	solve();
	return 0;
}