#include<algorithm>
#include<cmath>
#include<complex>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<vector>
using namespace std;

typedef long long int ll;
typedef unsigned long long int llu;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;

#define rrep(i, m, n) for(int i=m; i<n;  i++)
#define erep(i, n)    for(int i=1; i<=n; i++)
#define  rep(i, n)    for(int i=0; i<n;  i++)
#define rrev(i, m, n) for(int i=n-1; i>=m; i--)
#define erev(i, n)    for(int i=n; i>=1; i--)
#define  rev(i, n)    for(int i=n-1; i>=0; i--)
#define FOREACH(v) (v).begin(), (v).end
#define CNT(a, n, x)  (upper_bound(a, a+n, x)-lower_bound(a, a+n, x))
#define minup(m, x)   (m=min(m, x))
#define maxup(m, x)   (m=max(m, x))

#define INF 1000000000
#define MOD 1000000009
#define EPS 1E-8

#define MAX_N 10000

int n;
int dp[MAX_N+1];
queue<int> que;

int main()
{
  cin >> n;

  rep(i, n+1){
    dp[i] = INF;
  }

  dp[0] = -1;
  dp[1] = 1;
  que.push(2);

  while(!que.empty()){
    int top = que.front();  que.pop();
    int bit = 0;

    for(int i=top; i>0; i>>=1){
      bit += i & 1;
    }

    if(dp[top + bit] > dp[top] + 1){
      minup(dp[top + bit], dp[top] + 1);
      que.push(top + bit);
    }
    if(top - bit < 1) continue;
    minup(dp[top - bit], dp[top] + 1);
    que.push(top - bit);
  }

  cout << (dp[n] >= INF ? -1 : dp[n]) << endl;

  return 0;
}