//#pragma GCC optimize("Ofast","inline","-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
//#define int long long
using namespace __gnu_pbds;
using namespace std;

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

long long a[500010];

signed main()
{
	ios::sync_with_stdio(false);cin.tie(0);
	int n=500000;
	int b;cin>>b;
	int now=1;a[1]=300000000000ll;
	for(int i=2;i<=b;i++){
		int m=n-now+1;
		long long cur=1ll*(m+1)*a[now],rem=(m-2)-cur%(m-2);
		long long X=(a[now]-rem)/(m-2)+1;
		a[now+1]=rem+X*(m-2);
		a[now+2]=(cur+a[now+1])/(m-2);
		assert(1ll*(m+1)*a[now]>1ll*(m-1)*a[now+1]);
		assert(1ll*(m+1)*a[now]+1ll*a[now+1]==1ll*(m-2)*a[now+2]);
		now+=2;
	}
	for(int i=now+1;i<=n;i++){
		int m=n-i+1;
		a[i]=a[i-1]+1;
		assert(1ll*m*a[i-1]>1ll*(m-2)*a[i]);
	}
	cout<<n<<'\n';
	for(int i=1;i<=n;i++) cout<<a[i]<<' ';
	cout<<'\n';
	return 0;
}