#include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
#define IN(a,n) rep(i,n){ cin>>a[i]; }
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define int ll
void init(){
  cin.tie(0);
  ios::sync_with_stdio(false);
}


int f(int m){
  int res=0;
  while(m){
    res+=m%2;
    m/=2;
  }
  return res;
}

main(){
  int n;
  cin>>n;
  
  int a[110000]={};
  rep(i,n+1){
    a[i]=inf;
  }
  a[1]=1;
  queue<int> q;
  q.push(1);
  while(!q.empty()){
    int p=q.front(); q.pop();
    int t=f(p);
    if(p-t>1&&a[p-t]>a[p]){
      a[p-t]=a[p]+1;
      q.push(p-t);
    }if(p+t<=n&&a[p+t]>a[p]){
      a[p+t]=a[p]+1;
      q.push(p+t);
    }
  }


  cout<<(a[n]==inf?-1:a[n])<<endl;
}