#include<bits/stdc++.h>
using namespace std;
#define mod 998244353
inline int add(int x,int y) {return x+y>=mod?x+y-mod:x+y;}
inline int mul(int x,int y) {return 1ULL*x*y%mod;}
#define int long long
#define N 500005
int a[N],sum[N],val[N],n;
const int M=1000000000000;
void push(int v)
{
	a[++n]=v;
	sum[n]=sum[n-1]+v;
	val[n]=sum[n]+v*n;
	// printf("%lld : %lld\n",n,a[n]);
	// printf("%lld : %lld\n",n,val[n]);
}
signed main()
{
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	for(int i=1;i<=50000;i++)
	{
		push(M-i+1);
	}
	int V=val[n];
	for(int i=1;i<=100000;i++)
	{
		int ok=0,tv=V-sum[n];
		for(int j=1;j<=10;j++)
		{
			int rs=tv%(n+j+1);
			int cv=tv/(n+j+1);
			int diff=cv*(j-1)+j*(j-1)/2-rs;
			int gov=(n+j+1+diff)/(n+j+2);
			rs+=(n+j+1)*gov;
			cv-=gov;
			if(rs>a[n]*(j-1)-j*(j-1)) continue;
			// j-1 numbers, sum = rs
			// add cv
			// printf("%d\n",j);
			assert(j<=2);
			if(j>=2) push(rs);
			push(cv);
			ok=1;
			break;
			/*
			while(cv*(j-1)+j*(j-1)/2<rs)
			{
				rs+=n+j+1,cv--;
			}
			*/
		}
		assert(ok);
		// if(!ok) cout<<"bad "<<i<<endl;
	}
	cout<<n<<endl;
	for(int i=1;i<=n;i++) printf("%lld%c",a[i]," \n"[i==n]);
	return 0;
}