/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
const int INF=1e18;

#define pdd pair<double,double>
const double eps=1e-9;
pdd operator +(pdd x,pdd y)
{
	return mp(x.fi+y.fi,x.se+y.se);
}
pdd operator -(pdd x,pdd y)
{
	return mp(x.fi-y.fi,x.se-y.se);
}
pdd operator *(pdd x,double y)
{
	return mp(x.fi*y,x.se*y);
}
double dot(pdd x,pdd y)
{
	return x.fi*y.fi+x.se*y.se;
}
double det(pdd x,pdd y)
{
	return x.fi*y.se-y.fi*x.se;
}
// point q on seg p1--p2
bool onseg(pdd p1,pdd p2,pdd q)
{
	return fabs(det(p1-q,p2-q))<eps&&dot(p1-q,p2-q)<eps;
}
// line p1--p2 q1--q2 intersection
bool good(pdd p1,pdd p2,pdd q1,pdd q2)
{
	if(fabs(det(q2-q1,p2-p1))<eps) return 0;
	return 1;
}
pdd inter(pdd p1,pdd p2,pdd q1,pdd q2)
{
	if(fabs(det(p1-q1,p2-q2))<eps) return mp(-114514.0,-114514.0);
	return p1+(p2-p1)*(det(q2-q1,q1-p1)/det(q2-q1,p2-p1));
}
// if seg p1--q1 p2--q2 has intersection
bool hascommon(pdd p1,pdd q1,pdd p2,pdd q2)
{
	if(fabs(det(p1-q1,p2-q2))<eps) return onseg(p1,q1,p2)||onseg(p1,q1,q2)||onseg(p2,q2,p1)||onseg(p2,q2,q1);
	pdd tmp=inter(p1,q1,p2,q2);
	return onseg(p1,q1,tmp)&&onseg(p2,q2,tmp);
}
int n;
array<int,3> A[55];
int B[55];
mt19937_64 rnd(114514);
int gen_range(int l,int r)
{
	return l+rnd()%(r-l+1);
}
const int K=20001;
vector <pii > pts[55];
void solve()
{
	cin>>n;
	for(int i=1;i<=n;i++) cin>>A[i][0]>>A[i][1]>>A[i][2],A[i][0]+=1001,A[i][1]+=1001;
	sort(A+1,A+1+n);
	int maxx=0;
	for(int i=1;i<=n;i++) maxx=max(maxx,A[i][2]);
	cout<<maxx<<"\n";
	if(n==1)
	{
		while(maxx--)
		{
			int x=rnd()%1000000000,y=rnd()%1000000000;
			cout<<2<<" "<<x<<" "<<y<<" "<<A[1][0]-1001<<" "<<A[1][1]-1001<<"\n";
		}
		return;
	}
	for(int i=1;i+1<=n;i++)
	{
		int b=A[i][1]+K*A[i][0]/2;
		b++;
		for(int x=2;pts[i].size()<=50;x+=2) 
		{
			int y=x/2*(-K)+b;
			if(y<0) pts[i].pb(mp(x,y));
		}
	} 
	vector <pair<pdd,pdd > > seg; 
	for(int i=1;i<=maxx;i++)
	{
		vector <pii > vec;
		for(int j=1;j<=n;j++) 
		{
			if(A[j][2]>=i) vec.pb(mp(A[j][0],A[j][1]));
			if(j<n) vec.pb(pts[j][0]),pts[j].erase(pts[j].begin());
		}
		cout<<vec.size()<<" ";
		for(int j=0;j<vec.size();j++) vec[j].fi-=1001,vec[j].se-=1001;
		for(int j=0;j<vec.size();j++) 
		{
			cout<<vec[j].fi<<" "<<vec[j].se<<" ";
			if(j+1<vec.size()) seg.pb(mp((pdd)(vec[j]),(pdd)(vec[j+1])));
		}
		cout<<"\n";
	}
//	for(int i=0;i<seg.size();i++) for(int j=i+1;j<seg.size();j++) if(hascommon(seg[i].fi,seg[i].se,seg[j].fi,seg[j].se))
//	{
//		pdd t=inter(seg[i].fi,seg[i].se,seg[j].fi,seg[j].se);
//		cout<<"inter: \n"<<seg[i].fi.fi<<" "<<seg[i].fi.se<<" --- "<<seg[i].se.fi<<" "<<seg[i].se.se<<"\n";
//		cout<<seg[j].fi.fi<<" "<<seg[j].fi.se<<" "<<seg[j].se.fi<<" "<<seg[j].se.se<<"\n"<<t.fi<<" "<<t.se<<"\n";
//	}
	
}
signed main()
{
//	ios::sync_with_stdio(0);
//	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}