// tested by Hightail - https://github.com/dj3500/hightail
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
import std.datetime, std.bigint;

immutable inf = 101101101;

long k;

void main() {
    scan(k);

    int n = 50;

    auto ans = new long[](n);
    ans[] += n - 1 + k / n;

    foreach (i ; 0 .. n) {
        if (i < k % n) {
            ans[i] += n - k % n + 1;
        }
        else {
            ans[i] -= k % n;
        }
    }

    writeln(n);
    writefln("%(%s %)", ans);
}




void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}