#include<iostream>
#include<cassert>
using namespace std;
#include<iostream>
#include<algorithm>
#include<vector>
using Int=long long;
int sign(Int a){return a>0?1:a<0?-1:0;}
Int sqr(Int a){return a*a;}
struct Rational{
	Int a,b;
	Rational(Int a_=0):a(a_),b(1){}
	Rational(Int a_,Int b_){
		Int g=a_,h=b_;
		while(h){
			Int t=g%h;
			g=h;
			h=t;
		}
		a=a_/g;
		b=b_/g;
		if(b<0)a=-a,b=-b;
	}
	bool operator<(const Rational&r)const{return a*r.b<r.a*b;}
	bool operator==(const Rational&r)const{return a==r.a&&b==r.b;}
};
struct Point{
	Int x,y;
	Point(Int x_=0,Int y_=0):x(x_),y(y_){}
	Point operator-()const{return Point(-x,-y);}
	Point operator+(const Point&p)const{return Point(x+p.x,y+p.y);}
	Point operator-(const Point&p)const{return Point(x-p.x,y-p.y);}
	Point operator*(const Int k)const{return Point(x*k,y*k);}
	bool operator<(const Point&p)const{return x==p.x?y<p.y:x<p.x;}
	bool operator==(const Point&p)const{return x==p.x&&y==p.y;}
};
istream&operator>>(istream&is,Point&p){return is>>p.x>>p.y;}
ostream&operator<<(ostream&os,const Point&p){return os<<p.x<<' '<<p.y;}
struct Line{
	Point p1,p2;
	Line(Point p1_=Point(),Point p2_=Point()):p1(p1_),p2(p2_){}
};
struct Segment:Line{
	Segment(Point p1_=Point(),Point p2_=Point()):Line(p1_,p2_){}
};
struct Circle{
	Point o;
	Int r;
	Circle(Point o_=Point(),Int r_=0):o(o_),r(r_){}
};
using Polygon=vector<Point>;
//function list begin
Point vec(const Line&);
Int norm(const Point&);
Int norm(const Line&);
int argtype(const Point&);//(-pi,0]->-1,(0,pi]->1,(0,0)->0
bool argless(const Point&,const Point&);//sorting points with arg
Int dot(const Point&,const Point&);
Int cross(const Point&,const Point&);
enum{ONLINE_FRONT=-2,CLOCKWISE=-1,ON_SEGMENT=0,COUNTER_CLOCKWISE=1,ONLINE_BACK=2};
int ccw(const Point&,const Point&);
int ccw(const Point&,const Point&,const Point&);
int ccw(const Line&,const Point&);
bool orthogonal(const Point&,const Point&);
bool orthogonal(const Line&,const Line&);
bool parallel(const Point&,const Point&);
bool parallel(const Line&,const Line&);
bool intersect(const Line&,const Point&);
bool intersect(const Line&,const Line&);
bool intersect(const Segment&,const Point&);
bool intersect(const Segment&,const Segment&);
bool intersect(const Line&,const Segment&);
bool intersect(const Segment&,const Line&);
bool intersect(const Circle&,const Point&);
int intersect(const Circle&,const Line&);//overflow, count contacts
int intersect(const Circle&,const Segment&);//overflow, count contacts
bool intersect(const Circle&,const Circle&);
int count_tangent(const Circle&,const Circle&);//count common tangents
Int distance2(const Point&,const Point&);
Rational distance2(const Line&,const Point&);
Rational distance2(const Line&,const Line&);
Rational distance2(const Segment&,const Point&);
Rational distance2(const Segment&,const Segment&);
Rational distance2(const Line&,const Segment&);
Rational distance2(const Segment&,const Line&);
bool is_convex(const Polygon&);
Polygon convex_hull(Polygon,bool=false);
enum{OUT,ON,IN};
int contain(const Polygon&,const Point&);
int contain(const Circle&,const Point&);
int contain(const Circle&,const Segment&);
int convex_contain(const Polygon&,const Point&);//O(log |P|)
Int diameter2(Polygon P);
//function list end
Point vec(const Line&s){return s.p2-s.p1;}
Int norm(const Point&p){return p.x*p.x+p.y*p.y;}
Int norm(const Line&s){return norm(vec(s));}
Int dot(const Point&a,const Point&b){return a.x*b.x+a.y*b.y;}
Int cross(const Point&a,const Point&b){return a.x*b.y-a.y*b.x;}
int ccw(const Point&a,const Point&b)
{
	Int crs=cross(a,b);
	return crs>0?COUNTER_CLOCKWISE
		:crs<0?CLOCKWISE
		:dot(a,b)<0?ONLINE_BACK
		:norm(a)<norm(b)?ONLINE_FRONT
		:ON_SEGMENT;
}
int ccw(const Point&a,const Point&b,const Point&c){return ccw(b-a,c-a);}
int ccw(const Line&s,const Point&p){return ccw(s.p1,s.p2,p);}
bool intersect(const Segment&s,const Segment&t){
	return ccw(s,t.p1)*ccw(s,t.p2)<=0&&ccw(t,s.p1)*ccw(t,s.p2)<=0;
}
int N;
int X[50],Y[50],A[50],K[50];
const int a=10000,b=1;
vector<Point>L[50];
int up(int x)
{
	while((x%a+a)%a!=a/2)x++;
	return x;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>N;
	int maxa=0;
	for(int i=0;i<N;i++)
	{
		cin>>X[i]>>Y[i]>>A[i];
		maxa=max(maxa,A[i]);
		K[i]=a*X[i]+Y[i];
	}
	vector<int>k(K,K+N);
	sort(k.begin(),k.end());
	vector<int>mid;
	mid.reserve(N+1);
	mid.push_back(k[0]-1);
	for(int i=1;i<N;i++)assert(k[i-1]+1<k[i]);
	for(int i=0;i<N;i++)
	{
		mid.push_back(k[i]+1);
	}
	for(int i=0;i<mid.size();i++)
	{
		for(int x=0;x<maxa;x++)
		{
			//a*X+Y==mid[i]
			int X=x+2000;
			int Y=mid[i]-a*X;
			L[x].push_back(Point(X,Y));
		}
		if(i<k.size())
		{
			int id=0;
			while(K[id]!=k[i])id++;
			for(int x=0;x<A[id];x++)
			{
				L[x].push_back(Point(X[id],Y[id]));
			}
		}
	}
	if(false)
	{//check
		for(int i=0;i<N;i++)
		{
			int cnt=0;
			for(int j=0;j<maxa;j++)
			{
				bool fn=false;
				for(Point p:L[j])if(p==Point(X[i],Y[i]))fn=true;
				if(fn)cnt++;
			}
			assert(cnt==A[i]);
		}
		for(int i=0;i<maxa;i++)
		{
			assert(L[i].size()>=2);
			for(int j=0;j<L[i].size();j++)
			{
				assert(abs(L[i][j].x)<=(int)1e9);
				assert(abs(L[i][j].y)<=(int)1e9);
			}
			for(int j=0;j+1<L[i].size();j++)
			{
				Segment s(L[i][j],L[i][j+1]);
				for(int k=0;k+1<L[i].size();k++)
				{
					if(abs(j-k)<=1)continue;
					Segment t(L[i][k],L[i][k+1]);
					if(intersect(s,t))
					{
						Point p;
						int c=0;
						if(s.p1==t.p1)p=s.p1,c++;
						if(s.p1==t.p2)p=s.p1,c++;
						if(s.p2==t.p1)p=s.p2,c++;
						if(s.p2==t.p2)p=s.p2,c++;
						assert(c==1);
						bool fn=false;
						for(int i=0;i<N;i++)if(p==Point(X[i],Y[i]))fn=true;
						assert(fn);
					}
				}
				for(int k=0;k<maxa;k++)if(k!=i)
				{
					for(int l=0;l+1<L[k].size();l++)
					{
						Segment t(L[k][l],L[k][l+1]);
						if(intersect(s,t))
						{
							Point p;
							int c=0;
							if(s.p1==t.p1)p=s.p1,c++;
							if(s.p1==t.p2)p=s.p1,c++;
							if(s.p2==t.p1)p=s.p2,c++;
							if(s.p2==t.p2)p=s.p2,c++;
							assert(c==1);
							bool fn=false;
							for(int i=0;i<N;i++)if(p==Point(X[i],Y[i]))fn=true;
							assert(fn);
						}
					}
				}
			}
		}
	}
	cout<<maxa<<"\n";
	for(int i=0;i<maxa;i++)
	{
		cout<<L[i].size();
		for(Point p:L[i])cout<<" "<<p.x<<" "<<p.y;
		cout<<"\n";
	}
}