#include <bits/stdc++.h>
using namespace std;
long long abs(long long a, long long b) {
  if (a > b)
    return a - b;
  else
    return b - a;
}
long long twopow(long long x) {
  long long p = 1;
  for (long long i = 1; i < x + 1; i++) {
    p = p * 2;
    p = p % 1000003;
  }
  return p;
}
long long t = 0;
void num9(long long x) {
  while (x % 10 == 9) {
    x = x / 10;
    t++;
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long TESTS = 1;
  while (TESTS--) {
    long long n;
    cin >> n;
    long long a[n], b[n];
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
      b[i] = a[i];
    }
    long long z = 0, i = n - 1, t = 0, y = 0;
    while (i + 1) {
      if ((b[i] + z) % n != i) {
        if ((b[i] + z) % n < i)
          y = i - ((b[i] + z) % n);
        else
          y = i + n - ((b[i] + z) % n);
        z = z + y;
        b[i] = b[i] + z;
        t++;
      }
      i--;
    }
    cout << t + 1 << "\n";
    z = 0;
    i = n - 1;
    while (i + 1) {
      if ((a[i] + z) % n != i) {
        if ((a[i] + z) % n < i)
          y = i - ((a[i] + z) % n);
        else
          y = i + n - ((a[i] + z) % n);
        z = z + y;
        a[i] = a[i] + z;
        cout << 1 << " " << i + 1 << " " << y << "\n";
        t++;
      }
      i--;
    }
    cout << 2 << " " << n << " " << n << "\n";
  }
  return 0;
}
