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

    int main() {
        static const int maxn = 60, B = 50;
        int n, mx = 0;
        scanf("%d", &n);
        struct point {
            int x, y, a;
        };
        static point p[maxn];
        int mn=1e9;
        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),mn=min(mn,p[i].a);
        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; });
        printf("%d\n", mx);
        if(n==50){
            for(int i=1;i<=n;i++) p[i].a=mx;
            puts("3 -182 810 -200010182 10811 428 810");
            puts("3 -182 810 -200030182 10812 428 810");
        }
        for (int l = 1; l <= mx; l++) {
            int dx = (1 - 2 * (B + l)) * B , dy = B + l;
            vector<pair<int, int>> ans;
            int l1=1,r=n;
            if(n==50&&(l==1||l==2)) r=48,l1=47;
            for (int i = l1; i <= r; 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);
            }
            if(n==50&&l==1){
                // printf("%d", (int)ans.size());
                // for (auto p : ans) printf(" %d %d", p.first, p.second);
                // printf("\n");
                continue;
            }
            if(n==50&&l==2) continue;
            printf("%d", (int)ans.size());
            // if()
            for (auto p : ans) printf(" %d %d", p.first, p.second);
            printf("\n");
        }
        return 0;
    }
    /*
    2
    -945 382 2
    -825 381 2
    */