#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAX = (int)1e5;

int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    
    const ll MX = 1'000'000'000'000LL;

    ll a[505050];
    for (int i = 1; i <= 300000; i++) {
        a[i] = MX - i + 1;
    }
    for (int i = 300000; i < 500000; i += 2) {
        ll ss = 0, ee = MX;
        while (ss < ee) {
            ll k = (ss + ee) / 2;
            if ((__int128)i * (i + 1) * a[i] < (__int128)(i + 2) * (i + 3) * k) {
                ee = k;
            }
            else {
                ss = k + 1;
            }
        }
        a[i + 2] = ss;
        a[i + 1] = i * a[i] - (i + 3) * (a[i + 2]);
    }

    // ll mx = -1, sum = 0, cnt = 0;
    // for (int i = 1; i <= 500000; i++) {
    //     sum += a[i];
    //     if (i != 1) assert(a[i - 1] > a[i]);
    //     if (mx < i * a[i] + sum) {
    //         mx = i * a[i] + sum;
    //         cnt = 1;
    //     }
    //     else if (mx == i * a[i] + sum) {
    //         cnt++;
    //     }
    // }
    // cout << mx << ' ' << cnt << '\n';
    
    cout << 500000 << '\n';
    for (int i = 1; i <= 500000; i++) {
        cout << a[i] << '\n';
    }
    cout << '\n';
}