#include <iostream>
#include <bitset>
#include <vector>
#include <queue>
#include <utility>

using namespace std;

int main() {

  int n;
  unsigned int t;
  
  cin >> n;

  vector<int> sg(n);
  vector<bool> v(n, false);

  for (int i=0; i<n; i++) {
    t = i+1;
    sg[i] = __popcount(t);
  }

  queue<int> q;

  int u, ub, uf, cnt;
  q.push(0);
  u = 0; cnt = 0;
  
  while (!q.empty()) {
    
      u = q.front(); q.pop();

      if (v[u]==false) {
        v[u] = true;
        cnt++;   
      }
    
      if (u>=v.size()-1) break;

      ub = u - sg[u]; uf = u + sg[u];
      if (!(ub<0) && v[ub]==false && v[ub+sg[ub]]==false) q.push(ub);
      if (v[uf]==false && uf<=v.size()-1) q.push(uf);
  } 
  cout << endl;

  if (u != sg.size()-1) {cout << -1 << endl;}
  else {cout << cnt << endl;}

  return 0;
}