#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll mod = 1e9 + 7;

struct edge
{
    int a, b, c;
};
vector<edge> e;

void print()
{
    cout << e.size() << "\n";
    for (edge nw : e) cout << nw.a << " " << nw.b << " " << nw.c << "\n";
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0);

    int B = 631, id = 0;
    for (int j = 1; j + 23 <= B; j += 24)
        for (int k = 1; k + 23 <= B; k += 24)
        {
            id++; if (id > B) return print(), 0;
            for (int i = 0; i < 24; i++) e.emplace_back((edge){id, j + i + B, k + i + B + B});
        }
    return 0;
}