#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <iterator>

#define pb push_back
#define puts(x) cout << #x << " : " << x << endl;
#pragma GCC diagnostic ignored "-Wconversion"

#define REP(i,n) for (int i=0;i<(n);i++)
#define REPE(i,n) for (int i=0;i<=(n);i++)

#define init(a,b) memset((a), (b), (sizeof(a)));

#define PI 3.14159265
#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int INF = 1000*1000*1000;

int dp[10005];
int bitCount(int i) {
    i = i - ((i >> 1) & 0x55555555);
    i = (i & 0x33333333) + ((i >> 2) & 0x33333333);
    i = (i + (i >> 4)) & 0x0f0f0f0f;
    i = i + (i >> 8);
    i = i + (i >> 16);
    return i & 0x3f;
}

int main() {
    int N;cin>>N;
    queue<int> q;
    q.push(1);
    fill(dp, dp + 10005, INF);
    dp[1]=1;
    while(!q.empty()){
        int i = q.front();q.pop();
        int bit_count = bitCount(i);
        int bw = i - bit_count;
        int fw = i + bit_count;
        if(fw <= N && dp[fw]>dp[i]+1){
            dp[fw]=dp[i]+1;
            q.push(fw);
        }
        if(bw > 1 && dp[bw]>dp[i]+1){
            dp[bw]=dp[i]+1;
            q.push(bw);
        }
    }
    if(dp[N]==INF)cout<<-1<<endl;
    else cout<<dp[N]<<endl;
    return 0;
}