#define _CRT_SECURE_NO_WARNINGS
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) loop(i,0,b)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
template<class T> istream& operator>>(istream& is, vector<T>& v);
template<class T> ostream& operator<<(ostream& os, vector<T> const& v);
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream&, const tuple<T...>&){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream& os, const tuple<T...>& t){ os << (n==0?"":" ") << get<n>(t); _ot<n+1>(os, t); }
template<class...T> ostream& operator<<(ostream& os, const tuple<T...>& t){ _ot<0>(os, t); return os; }
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _it(istream&, tuple<T...>&){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _it(istream& is, tuple<T...>& t){ is >> get<n>(t); _it<n+1>(is, t); }
template<class...T> istream& operator>>(istream& is, tuple<T...>& t){ _it<0>(is, t); return is; }
template<class T> istream& operator>>(istream& is, vector<T>& v){ rep(i,v.size()) is >> v[i]; return is; }
template<class T> ostream& operator<<(ostream& os, vector<T> const& v){ rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os; }
#ifdef DEBUG
#define dump(...) (cerr<<#__VA_ARGS__<<" = "<<mt(__VA_ARGS__)<<" ["<<__LINE__<<"]"<<endl)
#else
#define dump(...)
#endif

template<typename T> inline size_t popcount(T x){
    static_assert(sizeof(x)*8 <= 128,  "popcount : must be shorter than 128 bits.");
    static_assert(is_integral<T>(), "popcount : must be integer.");
    static int const mask = 65535;
    static size_t dp[66000];
    if(dp[mask] != 16) for(int i = 0; i <= mask; i++) dp[i] = (i&1) + dp[i>>1];
    if(false){
    } else if(sizeof(T)*8 <= 16){
        return
            dp[x];
    } else if(sizeof(T)*8 <= 32){
        return
            dp[(int32_t)x] + dp[(int32_t)x>>16];
    } else if(sizeof(T)*8 <= 64){
        return
            dp[(int64_t)x&mask] + dp[((int64_t)x>>16)&mask] +
            dp[((int64_t)x>>32)&mask] + dp[((int64_t)x>>48)&mask];
    } else {
        return
            dp[(__int128_t)x&mask] + dp[((__int128_t)x>>16)&mask] +
            dp[((__int128_t)x>>32)&mask] + dp[((__int128_t)x>>48)&mask] +
            dp[((__int128_t)x>>64)&mask] + dp[((__int128_t)x>>80)&mask] +
            dp[((__int128_t)x>>96)&mask] + dp[((__int128_t)x>>112)&mask];
    }
}

int main(){
    int N;
    while(cin>>N){
        vi d(N+1,100000);
        d[1] = 1;
        queue<int> q;
        q.push(1);
        while(q.size()){
            int t = q.front();
            q.pop();
            dump(t);
            if(t==N){
                cout << d[t] << endl;
                goto END;
            }
            int k = popcount(t);
            if(t-k > 0 && d[t-k] > d[t]+1){
                d[t-k] = d[t]+1;
                q.push(t-k);
            }
            if(t+k <= N && d[t+k] > d[t]+1){
                d[t+k] = d[t]+1;
                q.push(t+k);
            }
        }
        cout << -1 << endl;
    END:;
    }
}