#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int ans=0;
vector<ll> v;
void solve(int n,ll R)
{
	ans++;
	if(ans==1e5) return;
	if(R==0) return;
	ll l=1,r=R-1,mid;
	while(l<r)
	{
		mid=(l+r)>>1;
		if(R*n<=mid*(n+4)) r=mid;
		else l=mid+1;
	}
	l--;
	v.push_back(l);
	v.push_back(R*n-l*(n+3));
	solve(n+2,l);
}
bool chk()
{
	sort(v.begin(),v.end());
	for(int i=0;i<(int)v.size()-1;i++)
		if(v[i]==v[i+1]) return 0;
	ll ans=0,cnt=0,sum=0;
	for(ll x:v) sum+=x;
	for(int i=0;i<(int)v.size();i++)
	{
		ll res=sum+((int)v.size()-i)*v[i];
		if(res>ans) ans=res,cnt=1;
		else if(res==ans) cnt++;
		sum-=v[i];
	}
	return cnt==1e5;
}
int main()
{
	int n=3e5;
	ll inf=1e12;
	for(int i=1;i<=n;i++) v.push_back(inf-i);
	solve(n,inf-n);
	printf("%d\n",(int)v.size());
	for(ll x:v) printf("%lld ",x);
}