#include <iostream> // cout, endl, cin
#include <cmath> //sqrt pow
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // dequef
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>

#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using ld = long double;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define mod 1000000007
using namespace std;
int cnt(int n){
  int res = 0;
  while(n){
    res += (n & 1);
    n >>= 1;
  }
  return res;
}
int main(){
  int n;
  cin >> n;
  int pos = 1, ans = 1;
  while(pos != n){
    int num = cnt(pos);
    if(pos + num > n && pos - num < 1){
      cout << -1 << endl;
      return 0;
    }
    if(pos + num > n) pos -= num;
    else pos += num;
    ans++;
    if(ans > n * 10){
      cout << -1 << endl;
      return 0;
    }
  }
  cout << ans << endl;
}