#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

const int N = 1010;
const int P = 3 * N;

array<int, 2> go(array<int, 2> pos, int k) {
    int x = pos[0], y = pos[1];
    y = y + 1 + (P + 1) * k;
    x = x + P + 1 + P * (P + 1) * k + k;
    return {x, y};
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;
    vector<array<int, 3>> a(n);
    int mx = 0;
    for (int i = 0; i < n; ++i) {
        cin >> a[i][0] >> a[i][1] >> a[i][2];
        mx = max(mx, a[i][2]);
    }
    sort(a.begin(), a.end(), [](array<int, 3> p, array<int, 3> q) {
        if (p[1] == q[1]) return p[0] < q[0];
        return p[1] > q[1];
    });
    vector<array<int, 2>> rep(n);
    for (int i = 0; i < n; ++i) {
        rep[i] = {a[i][0] + P * (N - a[i][1]), N};
    }
    cout << mx << "\n";
    for (int t = 0; t < mx; ++t) {
        vector<int> ind;
        for (int i = 0; i < n; ++i) {
            if (a[i][2] > t) {
                ind.push_back(i);
            }
        }
        vector<array<int, 2>> ans;
        for (int i = 0; i < (int)ind.size(); ++i) {
            if (i != 0 && ind[i - 1] + 1 != ind[i]) {
                ans.push_back(go(rep[ind[i] - 1], t));
            }
            ans.push_back({a[ind[i]][0], a[ind[i]][1]});
            ans.push_back(go(rep[ind[i]], t));
        }
        cout << ans.size() << " ";
        for (auto elem : ans) {
            cout << elem[0] << " " << elem[1] << " ";
        }
        cout << "\n";
    }
    return 0;
}