#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int k;
    cin >> k;

    if (k == 0) {
        cout << 1 << endl;
        cout << 1 << endl;
        return 0;
    }

    int p[5] = {}, q[5] = { 1, 5, 8, 13, 34 };

    for (;;) {
        int t = p[0] * (p[0] + 1) / 2;
        if (t > k) break;
        p[0]++;
    }
    k -= p[0] * (p[0] - 1) / 2;

    for (;;) {
        int t = (p[1] + 1) * (p[1] + 1);
        if (t > k) break;
        p[1]++;
    }
    p[2] = p[1];
    k -= p[1] * p[2];

    p[3] = 1;
    for (;;) {
        int t = p[3] * (p[4] + 1);
        if (t > k) break;
        p[4]++;
    }
    k -= p[3] * p[4];

    if (k != 0) throw;

    int n = 0;
    for (int i = 0; i < 5; i++) {
        n += p[i];
    }

    cout << n << endl;
    int h = 0;
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < p[i]; j++) {
            cout << q[i] << " \n"[h == n - 1];
            h++;
        }
    }

    return 0;
}