#include <bits/stdc++.h>
using namespace std;
typedef long long int LLI;

LLI a[500000];
LLI suff[500000];
int main() {
    int i,b;
    cin >> b;
    b = 100000;

    int k,n = 3*b-1;
    a[1] = 5e10;
    for (k = 1; k < 2*b-1; k += 2) {
        double l = (double) (n-k+3)/(n-k-1)*a[k];
        double r = (k == 2*b-1-2) ? 1e99:((double) (n-k+2)/(n-k-2)*a[k]);
        //if((k % 1000)==1)cout<<fixed<<setprecision(20)<<l<<","<<r<<endl;
        LLI x = floor(l)+1;
        if ((l < x) && (x < r)) {
            a[k+2] = x;
            a[k+1] = (n-k-1)*a[k+2]-(n-k+2)*a[k];
            assert(a[k] < a[k+1]);
            assert(a[k+1] < a[k+2]);
        }
        else assert(0);
    }
    for (k = 2*b; k <= n; k++) a[k] = a[k-1]+1;
    assert(a[n] < 1e12);

    for (k = n; k >= 1; k--) suff[k] = suff[k+1]+a[k];
    for (k = 1; k <= n; k++) {
        //cout << suff[k]+(n-k+1)*a[k] << " ";
        assert(suff[k]+(n-k+1)*a[k] <= suff[1]+(n-1+1)*a[1]);
        if ((k & 1) && (k <= 2*b-1)) assert(suff[k]+(n-k+1)*a[k] == suff[1]+(n-1+1)*a[1]);
    }
    //cout << endl;

    //cout<<a[n]<<endl;
    //return 0;
    printf("%d\n",n);
    for (i = 1; i <= n; i++) printf("%lld%c",a[i],(i == n) ? '\n':' ');

    return 0;
}