#include <bits/stdc++.h>
using namespace std;

signed main(){
  int N; cin >> N;
  queue< int > que;
  vector< int > dis( N + 1, ( int ) 1e9 );
  que.emplace( 1 );
  dis[ 1 ] = 1;
  while( not que.empty() ){
    int u = que.front(); que.pop();
    int nu = u + __builtin_popcount( u );
    if( nu <= N and dis[ nu ] > dis[ u ] + 1 )
      dis[ nu ] = dis[ u ] + 1,
      que.emplace( nu );
    int pu = u - __builtin_popcount( u );
    if( 1 <= pu and dis[ pu ] > dis[ u ] + 1 )
      dis[ pu ] = dis[ u ] + 1,
      que.emplace( pu );
  }
  if( dis[ N ] == ( int ) 1e9 )
    cout << -1 << endl;
  else
    cout << dis[ N ] << endl;
  return 0;
}