#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define veci vector<int>
#define vecll vector<ll>
#define vecpii vector<pii>
#define vec2(a,b) vector<vec>(a,vec(b))
#define vec2ll(a,b) vector<vec>(a,vecll(b))
#define vec3(a,b,c) vector<vector<vec>>(a,vec2(b,c))
#define vec3ll(a,b,c) vector<vector<vecll>>(a,vec2ll(b,c))
#define fi first
#define se second
#define all(c) begin(c),end(c)
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))


using namespace std;
int in() {int x;cin>>x;return x;}
ll lin() {ll x;cin>>x;return x;}
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T> inline void print(pair<T,T> p){cout<<"("<<p.first<<","<<p.second<<") ";}
//template<class T> inline void print(vector<pair<T,T>> v){for(auto e:v)print(e); cout<<endl;}
//template<class T> inline void print(T v){for(auto e:v)cout<<e<<" ";cout<<endl;}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
    for(T& x:vec) is >> x;
    return is;
}
const ll INF=1e9+7;

ll d[10010];

vector<ll> cnt(10010,0);

int main()
{
    ll n;
    cin >> n;
    
    rep(i,10010){
        d[i]=INF;
    }
    rep(i,n+1){
        for(ll j=0;j<20;j++){
            if((i>>j) & 1){
                cnt[i]++;
            }
        }
    }
    queue<ll> que;
    que.push(1);
    d[1]=1;
    while(!que.empty()){
        ll x=que.front();
        que.pop();
        if(x==n){
            break;
        }
        if(x+cnt[x]<=n && d[x+cnt[x]]==INF){
            d[x+cnt[x]]=d[x]+1;
            que.push(x+cnt[x]);
        }
        if(x-cnt[x]>=1 && d[x-cnt[x]]==INF){
            d[x-cnt[x]]=d[x]+1;
            que.push(x-cnt[x]);
        }
    }
    if(d[n]==INF) cout << -1 << endl;
    else cout << d[n] << endl;
    return 0;
}