#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;

typedef long long ll;

const int N = 5e5 + 5;
const ll inf = 1e12;

ll a[N];

void solve() {
    for (ll i = 1; i <= 300000; i++)
        a[i] = inf - i + 1ll;
    for (ll i = 300000; i < 500000; i += 2) {
        ll x = a[i] * i / (i + 4ll);
        if (x * (i + 4ll) == a[i] * i)
            x--;
        a[i + 2] = x;
        a[i + 1] = a[i] * i - a[i + 2] * (i + 3ll);
    }

    cout << 500000 << "\n";
    for (int i = 1; i <= 500000; i++) {
        cout << a[i] << " ";
    }
    cout << "\n";
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}