//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n=100005;
	vector<ll> vec;
	for(int i=1;i<=100000;i++)
		vec.pb(1000000000000-i+1);
	vec.pb(999999999999-100000);
	int p=100001;
	for(int i=1;i<=n;i++)
	{
		// if(vec.back()%(p+2)==0)
			// vec.pb(vec.back()/((p++)+2));
		// else
		{
			ll val=vec.back()*p/(p+4);
			vec.pb(vec.back()*p-val*(p+3));
			vec.pb(val);
			p+=2;
		}
	}
	rev(vec);
	srt(vec);
	cout<<sz(vec)<<'\n';
	for(auto x:vec)
		cout<<x<<" ";
	for(int i=1;i<sz(vec);i++)
		assert(vec[i-1]!=vec[i]);
	ll sum=accumulate(ALL(vec),0ll);
	map<ll,int> Mp;
	for(int i=0;i<sz(vec);i++)
	{
		Mp[sum+vec[i]*(sz(vec)-i)]++;
		sum-=vec[i];
	}
	pair<ll,int> pp;
	for(auto pr:Mp)
		if(pr.first>pp.first)
			pp=pr;
	cerr<<pp.first<<" "<<pp.second<<endl;
	assert(pp.second>=100001);
	return 0;
}