#pragma GCC optimize("O3") #include using namespace std; using ll=long long; using P=pair; template using V=vector; #define fi first #define se second #define all(v) (v).begin(),(v).end() const ll inf=(1e18); const ll mod=998244353; // const ll mod=1000000007; const vector dy={-1,0,1,0},dx={0,-1,0,1}; ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;} ll LCM(ll c,ll d){return c/GCD(c,d)*d;} struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout< bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } templatevoid debag(const vector &a){cerr<<"debag :";for(auto v:a)cerr<void print(const vector &a){for(auto v:a)cout<>=1ll; } return res; } mint inv()const{return pow(mod-2);} //拡張ユークリッドの互除法 /* mint inv()const{ int x,y; int g=extgcd(v,mod,x,y); assert(g==1); if(x<0)x+=mod; return mint(x); }*/ friend ostream& operator<<(ostream&os,const mint&val){ return os<(const mint&val)const{return v>val.v;} }; int main(){ ll n; cin>>n; if(n==0){ cout<<-1<<"\n"; return 0; } V ans; for(int i=0;i<50;i++){ if(i==0){ if(n&(1ll< res; for(int i=0;i<(int)ans.size();i++){ if(i+1<(int)ans.size()&&ans[i]==ans[i+1]){ i++; continue; } res.emplace_back(ans[i]); } swap(ans,res); cout<