#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 50
using namespace std;
const int inf=(int)(1e7);
int read()
{
	char c=0;
	int sum=0,f=1;
	while (c!='-'&&(c<'0'||c>'9')) c=getchar();
	if (c=='-') c=getchar(),f=-1;
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum*f;
}
struct reads
{
	int x,y,a;
	bool operator < (const reads &t)const
	{
		return x!=t.x?x<t.x:y<t.y;	
	}
};
reads st[N+1];
struct points
{
	int x,y;
};
points tong[N+1];
int n,length,maxn;
int main()
{
	n=read();
	for (int i=1;i<=n;++i) st[i].x=read(),st[i].y=read(),st[i].a=read(),maxn=max(maxn,st[i].a);
	if (n==1)
	{
		printf("%d\n",st[1].a);
		for (int i=1;i<=st[1].a;++i) printf("2 %d %d %d %d\n",st[1].x,st[1].y,st[1].x+1,st[1].y+i);
	}
	else
	{
		sort(st+1,st+n+1),printf("%d\n",maxn);
		for (int i=1;i<=maxn;++i)
		{
			length=0;
			for (int j=1;j<=n;++j)
			{
				if (j!=1) tong[++length]=(points){i*(st[j-1].x+st[j].x+4000)-2000,i*(st[j-1].y+st[j].y+2*inf)-inf};
				if (st[j].a>=i) tong[++length]=(points){st[j].x,st[j].y};
			}
			printf("%d ",length);
			for (int j=1;j<=length;++j) printf("%d %d ",tong[j].x,tong[j].y);
			puts("");
		}
	}
	return 0;
}