#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<int,int> P;
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<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const LL mod=1000000007;
const LL LINF=1LL<<62;
const int INF=1<<30;
int dx[]={1,0,-1,0,1,-1,1,-1};
int dy[]={0,1,0,-1,1,-1,-1,1};
 

int main(){
    int n;cin >> n;
    vector<bool> dp(n+1,false);
    queue<P> q;
    q.push(mp(1,1));
    while(not q.empty()){
        auto s = q.front();q.pop();
        int num = s.fs, c = s.sc;
        if(num == n){
            cout << c << endl;
            return 0;
        }
        if(dp[num]) continue;
        else dp[num] = true;
        int cost = __builtin_popcount(num);
        if(num - cost > 0) q.push(mp(num - cost, c + 1));
        if(num + cost <= n) q.push(mp(num + cost, c + 1));
    }
    cout << -1 << endl;
    return 0;
}