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; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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() {
  try {
    for (; ; ) {
      const K = readInt;
      auto D = new int[K];
      foreach (k; 0 .. K) {
        D[k] = readInt;
      }
      D.sort;
      
      const L = D[K - 1];
      const N = (L + 1) + (K - 1);
      int[] us = [0, L];
      
      void ae(int u, int v, int w) {
        writeln(u + 1, " ", v + 1, " ", w);
      }
      
      writeln(N);
      foreach (i; 0 .. L) ae(i, i + 1, 1);
      foreach (k; 0 .. K - 1) {
        const v = (L + 1) + k;
        ae(D[k] / 2, v, D[k] / 2);
        us ~= v;
      }
      writeln(us.length);
      foreach (j, u; us) {
        if (j) write(" ");
        write(u + 1);
      }
      writeln;
    }
  } catch (EOFException e) {
  }
}