#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>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
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 n;
  cin >> n;
  vector<int> a(n);
  rep(i,0,n) cin >> a[i];
  cout << 30 << endl;
  rep(t,0,30) {
    int v = dup(a[n-1]-a[0], 2);
    int r = n;
    rep(i,0,n) {
      if (a[i]+v > a[n-1]) {
        r = i;
        break;
      }
    }
    cout << 1 << " " << r << " " << v << endl;
    rep(i,0,r) a[i] += v;
    sort(all(a));
  }
  // rep(i,0,n) {
  //   cout << a[i] << " ";
  // }
  // cout << endl;
  return 0;
}