import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  enum LIM_N = 250;
  enum LIM_K = 10000;
  auto seqs = new int[][LIM_K + 1];
  foreach (a1; 0 .. LIM_N + 1) foreach (a2; 0 .. LIM_N - a1 + 1) foreach (a3; 0 .. LIM_N - a1 - a2 + 1) {
    if (a1 + a2 + a3 > 0) {
      int k;
      k += a1 * (a1 - 1) / 2;
      k += a1 * a2;
      k += a2 * a3;
      if (k <= LIM_K && seqs[k] is null) {
        seqs[k] = [0, a1, a2, a3];
      }
    }
  }
  foreach (k; 0 .. LIM_K + 1) {
    if (seqs[k] is null) {
      stderr.writeln("k = ", k);
      break;
    }
  }
  
  try {
    for (; ; ) {
      const K = readInt();
      int[] ans;
      foreach (i, c; seqs[K]) {
        ans ~= (cast(int)(i)).repeat(c).array;
      }
      writeln(ans.length);
      writeln(ans.to!string.replaceAll(regex(`[\[\],]`), ""));
    }
  } catch (EOFException e) {
  }
}