#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-4e3;

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

int N, K;
vector<Data> A1, A2;
int B1, B2;

int main()
{
    scanf("%d", &N);
    for(int i=1; i<=N; i++)
    {
        Data p;
        scanf("%d%d%d", &p.x, &p.y, &p.k);
        if(p.x>0) A1.push_back(p);
        else A2.push_back(p);
        K=max(K, p.k);
    }

    vector<int> V1, V2;
    for(int i=0; i<A1.size(); i++) for(int j=i+1; j<A1.size(); j++)
    {
        int x1=A1[i].x, y1=A1[i].y, x2=A1[i].x, y2=A1[i].y;
        if(x1==x2) continue;
        if(((y2-y1)*(-P-x1))%(x2-x1)==0)
        {
            int y=(y2-y1)*(-P-x1)/(x2-x1)+y1;
            if(-P<=y && y<=P) V1.push_back(y);
        }
    }
    sort(V1.begin(), V1.end());
    for(int i=0; i<=P; i++)
    {
        if(!binary_search(V1.begin(), V1.end(), i)) { B1=i; break; }
        if(!binary_search(V1.begin(), V1.end(), -i)) { B1=-i; break; }
    }
    for(int i=0; i<A1.size(); i++) A1[i].p=(ll)(A1[i].y-B1)*(Q-(-P))/(A1[i].x-(-P))+B1;

    for(int i=0; i<A2.size(); i++) for(int j=i+1; j<A2.size(); j++)
    {
        int x1=A2[i].x, y1=A2[i].y, x2=A2[i].x, y2=A2[i].y;
        if(x1==x2) continue;
        if(((y2-y1)*(P-x1))%(x2-x1)==0)
        {
            int y=(y2-y1)*(P-x1)/(x2-x1)+y1;
            if(-P<=y && y<=P) V2.push_back(y);
        }
    }
    sort(V2.begin(), V2.end());
    for(int i=0; i<=P; i++)
    {
        if(!binary_search(V2.begin(), V1.end(), i)) { B2=i; break; }
        if(!binary_search(V2.begin(), V1.end(), -i)) { B2=-i; break; }
    }
    for(int i=0; i<A2.size(); i++) A2[i].p=(ll)(A2[i].y-B2)*(-Q-P)/(A2[i].x-P)+B2;

    sort(A1.begin(), A1.end(), [&](const Data &p, const Data &q) { return p.p<q.p; });
    sort(A2.begin(), A2.end(), [&](const Data &p, const Data &q) { return p.p>q.p; });

    for(int i=0; i+1<A1.size(); i++) assert(A1[i].p+100<A1[i+1].p);
    for(int i=0; i+1<A2.size(); i++) assert(A2[i].p-100>A2[i+1].p);

    printf("%d\n", K);
    for(int i=1; i<=K; i++)
    {
        vector<pii> V;

        for(int j=0; j<A1.size(); j++)
        {
            if(A1[j].k>=i)
            {
                V.push_back({Q+i, A1[j].p-(K-i+1)});
                V.push_back({A1[j].x, A1[j].y});
                V.push_back({Q+i, A1[j].p+(K-i)});
            }
        }
        V.push_back({Q+i, 1e9-K+i});
        V.push_back({-Q-i, 1e9-K+i});
        for(int j=0; j<A2.size(); j++)
        {
            if(A2[j].k>=i)
            {
                V.push_back({-Q-i, A2[j].p+(K-i)});
                V.push_back({A2[j].x, A2[j].y});
                V.push_back({-Q-i, A2[j].p-(K-i+1)});
            }
        }
        
        printf("%d ", V.size());
        for(auto [x, y] : V) printf("%d %d ", x, y);
        printf("\n");
    }
}