#include<bits/stdc++.h>
#define int long long
using namespace std;

const int N=1000007;
const int mod=998244353;


int solve(vector<int>&lst,int a,int m){
    assert(m>2);
    int mxw=(2*a+m-2)/(m-1);
    int rem=(m+2)*a%(m-2);
    rem=m-2-rem;
    assert(rem<=mxw);
    lst.push_back(a+rem), lst.push_back(((m+2)*a+rem)/(m-2));
    assert(rem>0);
    assert(a+rem<((m+2)*a+rem)/(m-2));
    return ((m+2)*a+rem)/(m-2);
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int x=5e10, m=300001;
    vector<int> lst;
    lst.push_back(x);
    while (m>100000) x=solve(lst,x,m), m-=2;
    while (m>1) x++, lst.push_back(x), m--;
    cout<<lst.size()<<" ";
    for (auto c:lst) cout<<c<<" ";
    // reverse(lst.begin(), lst.end());
    // // for (int i=1;i<lst.size();++i) assert(lst[i-1]<lst[i]);
    // vector<int> ans;
    // int sum=0,k=1,mx=0;
    // for (auto c:lst) sum+=c, mx=max(mx,k*c+sum), k++;
    // int cnt=0;
    // sum=0, k=1;
    // for (auto c:lst) {
    //     sum+=c; 
    //     if (k*c+sum==mx) cerr<<k<<endl, cnt++;
    //     k++;
    // }
    // cerr<<lst.size()<<" "<<cnt;
    
}