#include <bits/stdc++.h>
#include <stdlib.h>

using namespace std;

//__builtin_popcount(n)

pair<int,bool> dopelnienie(int val, int n){
    int v = val;
    int p = 1;
    while(v && n>0){
        if(v%2 == 0){
            val+=p;
            n--;
        }
        p*=2;
        v/=2;
    }
    return {val, n==0};
}

vector<int> find_seq(int n){
    vector<int> res;

    if(n<=4){
        if(n == 1)return{1};
        else if(n == 2)return{1,2};
        else if(n == 3)return{1,3};
        else if(n == 4)return{1,2,3};
    }
    
    int ind = 1;
    int pop_cnt = __builtin_popcount(ind);
    
    while(n>0){
        res.push_back(ind);
        n-=pop_cnt;
        ind++;
        pop_cnt = __builtin_popcount(ind);
    }
    
    ind = res.size()-1;
    while(n<0){
        pop_cnt = __builtin_popcount(res[ind]);
        if(pop_cnt+n <= 0){
            n += pop_cnt;
            res[ind] = 0;
        }
        ind--;
    }
    vector<int> end_res;
    for(int r:res)if(r)end_res.push_back(r);
    return end_res;
}

int main(){
    int n;
    cin>>n;

    vector<int> tab = find_seq(n);
    cout<<tab.size()<<"\n";
    for(int i = tab.size()-1; i>=0; i--)cout<<tab[i]<<" ";cout<<"\n";


    return 0;
}