//
//  main.cpp
//  yuki-3
//
//  Created by Kenta Kodera on 2017/06/18.
//  Copyright © 2017年 Kenta Kodera. All rights reserved.
//

//
//  main.cpp
//  AOJ-1172-ans
//
//  Created by Kenta Kodera on 2017/06/18.
//  Copyright © 2017年 Kenta Kodera. All rights reserved.


#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
#include <stack>
#include <tuple>
#include <array>
#include <ctype.h> // isdigit
#include <cassert>
using namespace std;

int bitnum(int n){
  
  int bit = 0;
  while(n != 0){
    n &= n-1;
    bit++;
  }
  return bit;
}

int main(){
  
  int N; cin >> N;
  vector<int> dist(N+1, 0);
  queue<int> que;
  que.push(1);
  dist[1] = 1;
  while(que.size()){
    int n = que.front(); que.pop();
    int len = bitnum(n);
    if(n+len<=N && dist[n+len]==0){
      que.push(n+len);
      dist[n+len] = dist[n]+1;
    }
    if(0<n-len && dist[n-len]==0){
      que.push(n-len);
      dist[n-len] = dist[n]+1;
    }
  }
  if(dist[N] == 0){
    cout << -1 << endl;
  }else{
    cout << dist[N] << endl;
  }
  
  return 0;
}