#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll
#define fi first
#define se second
#define pb push_back
typedef long double ld;
#define double ld

vector<int> ans;
void solve(int k, int a, int n)
{
    if (a > 1e12)
        exit(4);
    if (n == 0)
    {
        while (k > 0)
        {
            a++;
            ans.pb(a);
            k--;
        }
        return;
    }

    if (k-1 == 0)
        exit(1);

    int rem = ((-2*a-k*a)%(k-1) + (k-1))%(k-1);
    int b = a-a%(k-1)+rem;
    while (b <= a) b += (k-1);
    int c = (2*a+k*a+b)/(k-1);
    if (c*(k-1) != (2*a+k*a+b))
        exit(2);

    ans.pb(b);
    ans.pb(c);
    if (c <= b)
        exit(3);
    solve(k-2, c, n-1);
}

int f(int x)
{
    int s = 0;
    for (int i : ans)
        if (x <= i) s += x+i;
    return s;
}

signed main()
{
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
    cout<<fixed<<setprecision(20);

    int K;
    cin>>K;
    int A = 50e9;
    ans.pb(A);
    solve(3e5+100, A, K);

    cout<<ans.size()<<"\n";
    for (int i : ans)
        cout<<i<<" ";
    cout<<"\n";
//    for (int i =0; i<20; i++)
//        cout<<f(ans[i])<<endl;

}