#pragma GCC optimize("O2")
#include<bits/stdc++.h>
#define ll   long long
#define pb   emplace_back
#define mp   make_pair
#define orz  1000000007
#define fi   first
#define se   second
using namespace std;
ll a[500005];
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	a[400001]=81ll*orz;
	for(ll k=399999;k>=200001;k-=2){
		ll A=a[k+2];
		ll d=k-A*4%k;
		assert(d*(k+1ll)<2*A-1);
		ll len=(4*A+d-k*d)/k;
		assert(len>=1);
		assert(d>=1);
		a[k+1]=a[k+2]+d;
		a[k]=a[k+1]+len;
	}
	for(int k=200000;k;--k)a[k]=a[k+1]+1;
	/*cerr<<"max"<<a[1]<<'\n';
	{
		ll s[500005]={};
		ll mx=0;
		int cnt=0;
		for(int i=1;i<=400001;++i){
			s[i]=s[i-1]+a[i];
			ll x=a[i]*i+s[i];
			if(x>mx)mx=x,cnt=0;
			if(x==mx)++cnt;
		}
		for(int i=1;i<=400000;++i)assert(a[i]>a[i+1]);
		cerr<<mx<<' '<<cnt<<endl;
	}
	return 0;*/
	cout<<"400001\n";
	for(int i=400001;i>1;--i)cout<<a[i]<<' ';
	cout<<a[1]<<'\n';
    return 0;
}