//We are Rock dayo!
#include <bits/stdc++.h>
using namespace std;
int main() {
    static const int maxn = 60, B = 5000;
    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);
    // (1,2*B) -> (2,4*B+1)
    sort(p + 1, p + n + 1,
        [](const point x, const point y) { return 2*x.x + (4 * B +1) * x.y < 2*y.x + (4 * B+1) * y.y; });
    printf("%d\n", mx);

    for (int l = 1; l <= mx; l++) {
        int dx = ( - (4*B+1) * (B + l -1)) - 2*B , dy = (B + l -1)*2+1;
        vector<pair<int, int>> ans;
        int l1=1,r=n;
        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==2) continue;
        printf("%d", (int)ans.size());
        for (auto p : ans) printf(" %d %d", p.first, p.second);
        printf("\n");
    }
    return 0;
}