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

static const int INF = 1e8;
bool flag[10001];
int cnt[10001];

int bitcnt(int num) {
  int ans=0;
  while(num>0) {
    if(num%2==1) ans++;
    num /= 2;
  }
  return ans;
}

int main() {
  for (int i=0; i<10001; i++) {
    flag[i] = false;
    cnt[i] = INF;
  }

  cnt[1]=1;

  int n;
  cin >> n;

  queue<int> q;
  q.push(1);

  while(!q.empty()) {
    int now=q.front();
    q.pop();
    if (flag[now]) continue;
    flag[now] = true;
    int d=bitcnt(now);

    if(1<=now-d&&now-d<=n&&flag[now-d]==false) {
      cnt[now-d] = min(cnt[now]+1,cnt[now-d]);
      q.push(now-d);
    }
    if(1<=now+d&&now+d<=n&&flag[now+d]==false) {
      cnt[now+d] = min(cnt[now]+1,cnt[now+d]);
      q.push(now+d);
    }
  }

  printf("%d\n", (flag[n])?cnt[n]:-1);

  return 0;
}