#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using pii=pair<int,int>;
using ll=long long;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=500010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

int n,m,b;
ll h[N],su[N],va[N];

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	//cin>>b;
	b=1e5+1;
	m=b;
	n=2*b+1;
	for (int i=0;i<=2*m;++i) h[i]=1e12-i;
	for (int i=m+1;i<n;++i)
	{
		h[2*i]=h[2*(i-1)]*(2*i-1)/(2*i+3);
		h[2*i-1]=h[2*(i-1)]*(2*i-1)-h[2*i]*(2*i+2);
		if (h[2*i]==h[2*i-1])
		{
			cout<<i<<endl;
			exit(0);
		}
	}
	sort(h,h+2*n-1);
	reverse(h,h+2*n-1);
	for (int i=0;i<2*n-2;++i) assert(h[i]!=h[i+1]);
	for (int i=0;i<2*n-1;++i) su[i+1]=su[i]+h[i];
	ll ma=0;
	for (int i=0;i<2*n-1;++i)
	{
		va[i]=su[i+1]+h[i]*(i+1);
		ma=max(ma,va[i]);
	}
	int cma=0;
	for (int i=0;i<2*n-1;++i) if (va[i]==ma) ++cma;
	assert(cma>=b);
	cout<<2*n-1<<en;
	for (int i=0;i<2*n-1;++i) cout<<h[i]<<' ';
	cout<<en;
}