/* -*- coding: utf-8 -*-
 *
 * 3057.cc:  No.3057 Tree Distance Set - yukicoder
 */

#include<cstdio>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_K = 150;
const int MAX_D = 300;
const int MAX_N = MAX_D + 1;

/* typedef */

/* global variables */

int ds[MAX_N];

/* subroutines */

/* main */

int main() {
  int k;
  scanf("%d", &k);
  for (int i = 0; i < k; i++) scanf("%d", ds + i);

  int maxd = *max_element(ds, ds + k);
  int n = maxd + 1;

  printf("%d\n", n);
  for (int i = 2; i <= maxd; i += 2) {
    printf("%d %d %d\n", i, i + 1, i / 2);
    printf("%d %d %d\n", i + 1, i - 1, 1);
  }
  printf("%d\n1", k + 1);
  for (int i = 0; i < k; i++) printf(" %d", ds[i]);
  putchar('\n');
  
  return 0;
}