#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 0;

#define int long long
void solve()
{
    int b;
    cin >> b;
    int n = 5e5;
    vector<int> a(2 * n + 2);

    auto make = [](int a, int b)
    {
        return (a + b - 1) / b;
    };
    a[0] = 293309723580;
    fr(i, 0, 2 * b - 2)
    {
        int t1 = make(4 * a[i], n - i - 1);
        a[i + 1] = a[i] + t1 * (n - i - 1) - 4 * a[i];
        a[i + 2] = a[i] + t1;

        i++;
    }
    cout << n << endl;
    fr(i, 2 * b, n - 1)
    {
        a[i + 1] = a[i] + 1;
    }
    fr(i, 2, n)
    {
        if (a[i] <= a[i - 1])
        {
            assert(0);
            cout << "Error 1: " << i << " \n";
        }
        if (a[i] > 1e12)
        {
            assert(0);
            cout << "Error 2: " << i << " \n";
        }
    }

    fr(i, 1, n) cout << a[i] << " ";
    cout << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    if (_output)
        cin >> _;
    // int l = 1e11, r = 3e11;
    // int ans = -1;
    // while (l <= r)
    // {
    //     int mid = (l + r) / 2;
    //     if (solve(mid))
    //     {
    //         ans = mid;
    //         l = mid + 1;
    //     }293309723580

    //     }
    // }
    // cout << ans << endl;
    solve();
    return 0;
}