#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    
    ll X=320000000000LL;
    vector<ll> A(1000002);
    for(ll a=1;a<=200000;a++) A[a]=X-a*1000;
    A[200001]=A[200000]-1;
    ll cn=0;
    ll sz;
    for(ll i=200001;cn<=100000;cn++){
        if((A[i]*i)%(i+2)==0){
            A[i+1]=(A[i]*i)/(i+2);
            i++;
        }else{
            ll L=0,R=(A[i]*i)/(i+3)+1;
            while(R-L>1){
                ll M=(L+R)/2;
                ll a=M,b=(A[i]*i)-a*(i+3);
                if(a>=b) R=M;
                else L=M;
            }
            ll a=L,b=(A[i]*i)-a*(i+3);
            //ll a=(A[i]*i)/(i+3),b=(A[i]*i)-a*(i+3);
            while(1){
                //cout<<b<<" "<<a<<endl;
                if(A[i]>b&&b>a&&(A[i]*i)>(b)*(i+2)) break;
                a--;
                b+=(i+3);
            }
            A[i+1]=b;
            A[i+2]=a;
            i+=2;
        }
        //if(cn%100==0) cout<<cn<<endl;
        sz=i;
    }
    
    cout<<sz<<"\n";
    for(ll i=1;i<=sz;i++) cout<<A[i]<<" ";
    cout<<endl;
    return 0;
    vector<ll> S=A;
    for(ll i=2;i<=sz;i++){
        S[i]+=S[i-1];
    }
    ll ma=0;
    cn=0;
    for(ll i=1;i<=sz;i++){
        S[i]+=A[i]*i;
        if(chmax(ma,S[i])){
            cn=1;
        }else if(ma==S[i]){
            cn++;
        }
    }
    cout<<sz<<endl;
    cout<<ma<<" "<<cn<<endl;
}