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

int main() {
    static const int maxn = 60, B = 10000;
    int n, mx = 0;
    scanf("%d", &n);
    struct point {
        int x, y, a;
    };
    static point p[maxn];
    for (int i = 1; i <= n; i++) scanf("%d %d %d", &p[i].x, &p[i].y, &p[i].a), mx = max(mx, p[i].a);
    printf("%d\n", mx);
    for (int l = 1; l <= mx; l++) {
        int dx = (1 - 4 * (B + l)) * B - 1000, dy = 2 * B + l;
        vector<pair<int, int>> ans;
        for (int i = 1; i <= n; i++)
            if (p[i].a < l){
            	if(p[i].a==l-1)
					p[i].x -= 2 * B, p[i].y++;
				else p[i].x -= 4 * B, p[i].y+=2;
			}
        sort(p + 1, p + n + 1,
             [](const point x, const point y) { return x.x + 2 * B * x.y < y.x + 2 * B * y.y; });
        for (int i = 1; i <= n; i++) {
            ans.emplace_back(p[i].x, p[i].y);
            ans.emplace_back(p[i].x + dx, p[i].y + dy);
        }
        printf("%d", (int)ans.size());
        for (auto p : ans) printf(" %d %d", p.first, p.second);
        printf("\n");
    }
    return 0;
}