#include <bits/stdc++.h>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

int bc(int x){
  return (x==0? 0: bc(x>>1)+(x&1));
}

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N; cin >> N;
  VI dist(N+1, -1);
  queue<int> q;
  dist[1] = 1;
  q.push(1);
  while(!q.empty()){
	int x = q.front(); q.pop();
	int dx = bc(x);
	if(x+dx <= N && dist[x+dx] < 0){
	  dist[x+dx] = dist[x] + 1;
	  q.push(x+dx);
	}
	if(0 < x-dx && dist[x-dx] < 0){
	  dist[x-dx] = dist[x] + 1;
	  q.push(x-dx);
	}
  }
  cout << dist[N] << endl;

  return 0;
}