#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
#define pq(T) priority_queue<T, vector<T>, greater<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  int k;
  cin >> k;
  vector<int> d(k);
  rep(i,0,k) cin >> d[i];
  sort(all(d));
  int p = 0;
  cout << 2*k+1 << endl;
  rep(i,0,k) {
    cout << 2*i+1 << " " << 2*i+3 << " " << (d[i]-p)/2 << endl;
    cout << 2*i+2 << " " << 2*i+3 << " " << d[i]/2 << endl;
    p = d[i];
  }
  cout << k+1 << endl;
  cout << 1 << " ";
  rep(i,0,k) {
    cout << 2*i+2 << " \n"[i==k-1];
  }
  return 0;
}