import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, 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)); }


enum LIM = 10^^5;
enum K = 10L^^9;

void main() {
  try {
    for (; ; ) {
      const X = readLong();
      
      for (long n = 1; ; ++n) {
        const q = X / n, r = X % n;
        if (q + 1 <= LIM && n - r >= 3) {
          auto as = new long[q + 1];
          auto bs = new long[n];
          as[0 .. q] = K;
          as[q] = 1;
          bs[0 .. r] = K;
          bs[r .. n] = 1;
          const diff = X - (n - r);
          bs[n - 1] += diff;
          bs[n - 1] %= K;
          for (; bs[n - 1] <= 0; bs[n - 1] += K) {}
          if (bs[n - 1] == K) {
            --bs[n - 1];
            ++bs[n - 2];
          }
          writeln(q + 1, " ", n, " ", K);
          write("*");
          foreach (j; 0 .. n) {
            write(" ", bs[j]);
          }
          writeln();
          foreach (i; 0 .. q + 1) {
            writeln(as[i]);
          }
          break;
        }
      }
    }
  } catch (EOFException e) {
  }
}