#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <functional>
#include <vector>
#include <bitset>
#include <deque>
#include <queue>

int numofbits(long bits){
  bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
  bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
  bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
  bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
  return (bits & 0x0000ffff) + (bits >>16 & 0x0000ffff);
}

long long int N;
long long int move;


int main(int argc, char** argv){
  std::cin >> N;
  float amount = std::floor(log2(N));
  if(amount <= 0) amount = 0;
  std::queue<long> q;
  for(float i = N; std::ceil(log2(i)) + 1> log2(N); i--){
    if(i + numofbits(i) == N) q.push(i); 
  }
  std::cout << "bits:" << amount << std::endl;
  if(q.empty()) std::cout << "-1" << std::endl;
  else{
    for(unsigned int i = 0; i< q.size(); i++){
      std::cout << q.front() << std::endl;
      q.pop();
    }
  }
}