#include <bits/stdc++.h>
using namespace std;
const int N = 2e6;
map<int, int> m2;
map<int, bool> m1;
pair<int, int> p[N];
vector<long long> v;
int a[N];
int main() {
  int n, k;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  cout << n + 1 << endl;
  for (int i = n - 1; i >= 0; i--) {
    long long int x = a[i] % n;
    long long int q = i;
    if (q < x) {
      q = n - abs(q - x);
    } else {
      q = i - x;
    }
    cout << 1 << " " << i + 1 << " " << q << endl;
    for (int j = 0; j <= i; j++) {
      a[j] += q;
    }
  }
  cout << 2 << " " << n << " " << n;
  return 0;
}
