#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;

int main(){
	int n;
	cin >> n;
	if(n % 2 == 1) {
		cout << -1;
		return 0;
	}
	int a = n;
	int d = 0, anslen = 0;
	int ans[100001] = {};
	while(a >= 0) {
		while(a % 2 != 1) {
			d++;
			a /= 2;
	    }
	    ans[anslen] = pow(2, d);
	    a--;
	    anslen++;
	}
	sort(ans, ans + anslen);
	for(int i = anslen - 1; i >= 0; i--) {
		cout << ans[i] << " ";
	}
	return 0;
}