#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define int ll

const int N=55,S=6000;

struct point
{
    int x,y,a;
};

bool operator<(point p,point q)
{
    return p.x+S*p.y<q.x+S*q.y;
}

point pts[N];
vector<pair<int,int>> ans[N];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin>>n;
    int k=0;
    for(int i=1;i<=n;i++)
        cin>>pts[i].x>>pts[i].y>>pts[i].a,
        k=max(k,pts[i].a);
    sort(pts+1,pts+n+1);
    for(int i=1;i<=n;i++)
    {
        auto[x,y,a]=pts[i];
        int xy=x+S*y;
        for(int j=1;j<=a;j++)
            ans[j].emplace_back(x,y);
        for(int j=a+1;j<=k;j++)
            ans[j].emplace_back(xy%S+j*S,xy/S-j);
        xy+=S/2;
        for(int j=1;j<=k;j++)
            ans[j].emplace_back(xy%S+j*S,xy/S-j);
    }
    cout<<k<<"\n";
    for(int i=1;i<=k;i++)
    {
        cout<<ans[i].size()<<" ";
        for(auto[x,y]:ans[i])
            cout<<x<<" "<<y<<" ";
        cout<<"\n";
    }
}