#include <bits/stdc++.h>

using namespace std;

#define LOG(...) fprintf(stderr,__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

int n;

void dfs(vi& dp, int s, int cnt) {
    dp[s] = cnt;
    cnt++;
    int step = __builtin_popcount(s);
    for (int i = -1; i <= 1; i += 2) {
        int ns = s + step * i;
        if (1 <= ns && ns <= n) {
            if (dp[ns] == -1 || dp[ns] > cnt) {
                dfs(dp, ns, cnt);
            }
        }
    }
}

int main() {
    cin >> n;

    vi dp(n+1, -1);
    dfs(dp, 1, 1);
    cout << dp[n] << endl;
}