#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] = (int)__popcount(t);
  }

  queue<int> q;

  int i, u, m, cnt;
  q.push(0);
  u = 0; i = 0; m = 0; cnt = 0;
  
  while (!q.empty()) {

    u = q.front(); q.pop();
    v[u] = true;
    cnt++;   
    
    m = sg[u];

    for (i=(m%2==0 ? u : u+1); i<=u+m; i+=2) {
      if (i>=n) continue;
      if (v[i]==true) continue;
      q.push(i);
    }
  } 
  
 if (u!=sg.size()-1) {cout << -1 << endl;}
 else {cout << cnt << endl;}

  return 0;
}