n居然能大于2的20次方

#include <iostream>
#include <vector>
using namespace std;

int main(){
int n;
cin >> n;
if(n % 2 != 0){
cout << -1 << endl;
return 0;
}
vector<int> result;

for (int k = 23; k > 0; k--)
    {
      int power = 1 << k;
        if(n >= power){
            result.push_back(power);
            n = n - power;
        }
    }

for (size_t i = 0; i < result.size(); i++)
    {
        if(i > 0) cout <<' ';
        cout << result[i];
    }
return 0;

}