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

int main() {
    static const int maxn = 60, B = 1000;
    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);
    sort(p + 1, p + n + 1, [](const point x, const point y) { return x.y != y.y ? x.y < y.y : x.x < y.x; });
    printf("%d\n", mx);
    for (int i = 1; i <= n; i++) p[i].a = n == 50 ? mx : p[i].a;
    for (int l = 1; l <= mx; l++) {
        int dx = (1 - 2 * l) * B, dy = l;
        vector<pair<int, int>> ans;
        for (int i = 1; i <= n; i++) {
            if (p[i].a >= l)
                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;
}