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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 50;
const int P = 1e3;
const int Q = 1e9-1e4;

struct Data
{
    int x, y, k, p;
};

int N, K;
Data A[MAXN+10];
int B;

int main()
{
    scanf("%d", &N);
    for(int i=1; i<=N; i++) scanf("%d%d%d", &A[i].x, &A[i].y, &A[i].k), K=max(K, A[i].k);

    vector<int> V;
    for(int i=1; i<=N; i++) for(int j=i+1; j<=N; j++)
    {
        int x1=A[i].x, y1=A[i].y, x2=A[i].x, y2=A[i].y;
        if(x1==x2) continue;
        if(((y2-y1)*(-3*P-x1))%(x2-x1)==0)
        {
            int y=(y2-y1)*(-3*P-x1)/(x2-x1)+y1;
            if(-P<=y && y<=P) V.push_back(y);
        }
    }
    sort(V.begin(), V.end());
    for(int i=0; i<P; i++)
    {
        if(!binary_search(V.begin(), V.end(), i)) { B=i; break; }
        if(!binary_search(V.begin(), V.end(), -i)) { B=-i; break; }
    }

    for(int j=1; j<=N; j++)
    {
        A[j].p=(ll)(A[j].y-B)*(Q-(-3*P))/(A[j].x-(-3*P))+B;
    }
    sort(A+1, A+N+1, [&](const Data &p, const Data &q) { return p.p<q.p; });

    printf("%d\n", K);
    for(int i=1; i<=K; i++)
    {
        int bef=-1e9-100;
        vector<pii> V;
        for(int j=1; j<=N; j++)
        {
            if(A[j].k>=i)
            {
                if(bef==-1e9-100)
                {
                    V.push_back({Q, A[j].p-(K-i+1)});
                    V.push_back({A[j].x, A[j].y});
                    V.push_back({Q, A[j].p+(K-i)});
                }
                else
                {
                    V.pop_back();
                    V.push_back({Q+i, bef});
                    V.push_back({Q+i, A[j].p-(K-i+1)});

                    //V.push_back({Q, A[j].p-(K-i+1)});
                    V.push_back({A[j].x, A[j].y});
                    V.push_back({Q, A[j].p+(K-i)});
                }
                bef=A[j].p+(K-i);
            }
        }
        printf("%d ", V.size());
        for(auto [x, y] : V) printf("%d %d ", x, y);
        printf("\n");
    }
}