#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll A=1e12,c=3e5;int n;
ll a[500011],sum[500011];
int b;
vector<ll> val;
int main()
{
	scanf("%d",&b);
	n=2*b-1;
	a[n]=A-c;
	ll lst=1ll*(1+c)*a[n];
	for(int i=n-2;i>=1;i-=2)
	{
		if(lst%((n-i)+2+1+c)==0)a[i]=(lst-1)/((n-i)+2+1+c);
		else a[i]=lst/((n-i)+2+1+c);
		a[i+1]=lst-((n-i)+2+c)*a[i];
		lst-=a[i]+a[i+1];
	}
	printf("%d\n",n+c);
	for(int i=1;i<=n;++i)printf("%lld ",a[i]);
	for(int i=1;i<=c;++i)printf("%lld ",a[n+i]=A-c+i);putchar(10);
	for(int i=1;i<n+c;++i)assert(a[i]<a[i+1]);
	// for(int i=1;i<=n+c;++i)if(a[i]!=a[i-1])
	// {
	// 	ll ans=0;
	// 	for(int j=1;j<=n+c;++j)if(a[i]<=a[j])ans+=a[i]+a[j];
	// 	val.push_back(ans);
	// }
	// printf("val:");for(ll x:val)printf("%lld ",x);putchar(10);
	// sort(val.begin(),val.end(),greater<ll>());
	// for(int i=1;i<val.size();++i)if(val[i]!=val[i-1]){printf("%d\n",i);break;}
	fclose(stdin);fclose(stdout);return 0;
}