#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

ll n;
vll pre(100001, -1);
void f(ll now){
  //std::cout << now << '\n';
  if(now==1) pre[1] = 0;
  ll nxta = now + __builtin_popcount(now);
  if(nxta<=n&&pre[nxta]==-1) pre[nxta] = now;
  ll nxtb = now - __builtin_popcount(now);
  if(nxtb>0&&pre[nxtb]==-1) pre[nxtb] = now;
  if(pre[nxta]==now) f(nxta);
  if(pre[nxtb]==now) f(nxtb);
}
int main(int argc, char const *argv[]) {
  std::cin >> n;
  f(1);
  if(pre[n]==-1){
    std::cout << -1 << '\n';
    return 0;
  }
  ll ans = 0;
  ll now = n;
  while(now){
    ans++;
    now = pre[now];
  }
  std::cout << ans << '\n';
}