#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 55;
const int INF = 1e9 + 77;
const long long INFINF = 1e18 * 2;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
vector<int> months = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
long long power(long long x, long long y) {
  if (y == 0) return 1;
  long long s = power(x, y / 2);
  s *= s;
  if (y % 2 == 1) s *= x;
  return s;
}
int n;
int x[MAX];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x[i];
  }
  cout << n + 1 << '\n';
  cout << 2 << " " << n << " " << 1 << '\n';
  cout << 1 << " " << n << " " << 1000000 << '\n';
  long long cur = (1e6) - 1;
  for (int i = 0; i < n - 1; i++) {
    cout << 2 << " " << i + 1 << " " << cur << '\n';
    cur--;
  }
  return 0;
}
