#include <bits/stdc++.h>

using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    constexpr int B = 100000;
    int b;
    std::cin >> b;
    assert(b <= B);
    
    i64 sum = 0;
    
    constexpr int N = 5 * B;
    constexpr int T = 1000;
    std::vector<i64> a(N);
    for (int i = 0; i < N; i++) {
        if (8E22 / (i + 1) / (i + 2) > 1E12 - i) {
            a[i] = 1E12 - i;
        } else {
            a[i] = 8E22 / (i + 1) / (i + 2);
        }
    }
    
    std::vector<i64> f(N);
    sum = 0;
    for (int i = 0; i < N; i++) {
        f[i] = (i + 2) * a[i] + sum;
        if (i >= N - 2 * B && f[i] - f[i - 1] < 0) {
            i64 t = f[i - 1] - f[i];
            a[i] += t / (i + 2) + 1;
            f[i] = (i + 2) * a[i] + sum;
        }
        sum += a[i];
    }
    for (int i = 1; i < N; i++) {
        assert(a[i] < a[i - 1]);
    }
    for (int i = N - 2; i >= N - 2 * B; i -= 2) {
        if (a[i] - (f[i + 1] - f[i - 1]) > a[i + 1]) {
            a[i] -= (f[i + 1] - f[i - 1]);
        } else {
            assert(false);
        }
    }
    for (int i = N - 2 * B - 1; i >= 0; i--) {
        a[i] = a[i + 1] + 1;
    }
    sum = 0;
    for (int i = 0; i < N; i++) {
        f[i] = (i + 2) * a[i] + sum;
        sum += a[i];
    }
    for (int i = 1; i < N; i++) {
        assert(a[i] < a[i - 1]);
    }
    
    std::cout << N << "\n";
    for (int i = 0; i < N; i++) {
        std::cout << a[i] << " \n"[i == N - 1];
    }
    
    return 0;
}