#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}
unsigned long long popcount(unsigned long long x) {
  x = ((x & 0xaaaaaaaaaaaaaaaaUL) >> 1) +
      (x & 0x5555555555555555UL);
  x = ((x & 0xccccccccccccccccUL) >> 2) +
      (x & 0x3333333333333333UL);
  x = ((x & 0xf0f0f0f0f0f0f0f0UL) >> 4) +
      (x & 0x0f0f0f0f0f0f0f0fUL);
  x = ((x & 0xff00ff00ff00ff00UL) >> 8) +
      (x & 0x00ff00ff00ff00ffUL);
  x = ((x & 0xffff0000ffff0000UL) >> 16) +
      (x & 0x0000ffff0000ffffUL);
  x = ((x & 0xffffffff00000000UL) >> 32) +
      (x & 0x00000000ffffffffUL);
  return x;
}

ll dp[20010];

int main(void){
	for(ll i=0;i<20010;i++)dp[i]=(ll)INF;
	dp[1]=1;
	int n;
	cin>>n;
	if(n==1){
		cout<<1<<endl;
		return 0;
	}
	queue<ll>que;
	que.push(1);
	while(!que.empty()){
		ll i = que.front();
		que.pop();
		if(i>n)continue;
		ll t = popcount(i);
		if(dp[i+t]>dp[i]+1){
			dp[i+t]=dp[i]+1;
			que.push(i+t);
		}
		if((i-t>=1)&&dp[i-t]>dp[i]+1){
			dp[i-t]=dp[i]+1;
			que.push(i-t);
		}
	}
	if(dp[n]==(ll)INF)cout<<-1<<endl;
	else cout<<dp[n]<<endl;
	return 0;
}