#include <cmath>
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;
typedef long double db;
const db eps = 1e-8;
typedef long long ll;
int sgn(db x)
{
    if(fabs(x) < eps) return 0;
    if(x < 0) return -1;
    else return 1;
}

struct Point
{
    db x,y;
    Point(){}
    Point(db x_, db y_):x(x_),y(y_){}
    
    Point operator - (const Point& b){return Point(x-b.x,y-b.y);}
    db operator ^ (const Point& b){
        return x*b.y - y*b.x;
    }
    bool operator < (Point b) const {return sgn(x-b.x)==0?sgn(y-b.y)<0:x<b.x;}
    bool operator == (Point b) const {return sgn(x-b.x) == 0 && sgn(y-b.y) == 0;}
    bool operator <= (Point b) const {return sgn(x-b.x)==0?sgn(y-b.y)<=0:x<b.x;}
    Point operator *(const double &k)const{
		return Point(x*k,y*k);
	}
    db distance(Point p){
		return hypot(x-p.x,y-p.y);
	}
    void input(){
		scanf("%Lf %Lf",&x,&y);
	}
	void output(){
		printf("%.2f %.2f\n",x,y);
	}
};

struct Line
{
    Point s,e;
    Line(){}
    Line(Point s_, Point e_):s(s_),e(e_){}
    Line(db a, db b, db c)
    {
        if(sgn(a) == 0)
        {
            s = Point(0, -c/b);
            e = Point(1, -c/b);
        } else if(sgn(b) == 0)
        {
            s = Point(-c/a, 0);
            e = Point(-c/a, 1); 
        } else 
        {
            s = Point(0, -c/b);
            e = Point(1, (-c-a)/b);
        }
    }

    Point crosspoint(Line v)
    {
        // printf("crossing:\n");
        // s.output();e.output();
        // printf("with\n");
        // v.s.output();v.e.output();
        db a1 = (v.e-v.s)^(s-v.s);
        db a2 = (v.e-v.s)^(e-v.s);
        // printf("a1:%.10Lf a2:%.10Lf\n",a1,a2);
        // printf("res:");
        // printf("%.2Lf %.2Lf\n",(s.x*a2-e.x*a1)/(a2-a1), (s.y*a2-e.y*a1)/(a2-a1));
        // printf("a2-a1=%.10Lf\n",a2-a1);
        // printf("a2-a1=%.10Lf\n",db((ll)a2-(ll)a1));
        
        // printf("a2/(a2-a1)=%.10Lf\n",a2/(a2-a1));
        return Point(s.x*(a2/(a2-a1))-e.x*(a1/(a2-a1)), s.y*(a2/(a2-a1))-e.y*(a1/(a2-a1))); 
    }
    int linecrossseg(Line v)
    {
        // printf("crossing:\n");
        // s.output();e.output();
        // printf("with\n");
        // v.s.output();v.e.output();
		int d1 = sgn((e-s)^(v.s-s));
		int d2 = sgn((e-s)^(v.e-s));
		if((d1^d2)==-2) return 2;
		return (d1==0||d2==0);
	}
    bool parallel(Line v){
		return sgn((e-s)^(v.e-v.s)) == 0;
	}
    int relation(Point p){
		int c = sgn((p-s)^(e-s));
		if(c < 0)return 1;
		else if(c > 0)return 2;
		else return 3;
	}
    int linecrossline(Line v){
		if((*this).parallel(v))
			return v.relation(s)==3;
		return 2;
	}
    db length(){
		return s.distance(e);
	}
    db dispointtoline(Point p){
		return fabs((p-s)^(e-s))/length();
	}

};

db cross(Point A,Point B,Point C){
	return (B-A)^(C-A);
}


struct Ele
{
    Point s,e;
    int cnt;
};

const int N=60;
Point u(10001,2);
Point v(-2, 10001);
int n;

Point p[N];
int a[N];
// Line l[N];
Point mid[N];
Ele e[N];


bool cmp(const Ele& a, const Ele& b)
{
    return a.s < b.s;
}

int main()
{
    scanf("%d",&n);
    Line ax(Point(0,0), u);
    for(int i=1;i<=n;i++)
    {
        p[i].input();
        scanf("%d",&a[i]);
        Point pt = ax.crosspoint(Line(p[i], p[i]-v));
        e[i]=Ele{pt, p[i], a[i]};
        // l[i]=Line(pt, p[i]);
    };
    sort(e+1,e+n+1,cmp);
    for(int i=1;i<=n;i++)
        p[i]=e[i].e;
    for(int i=1;i<=n;i++)
        a[i]=e[i].cnt;
    for(int i=2;i<=n;i++)
    {
        Point pt = p[i];
        pt.y-=1;
        if(pt == p[i-1])
        {
            pt.y += 0.5;
            pt.x += v.x/2;
            pt.y += v.y/2;
        };
        mid[i]=pt;
    };

    int mx=0;
    for(int i=1;i<=n;i++)
        mx=max(mx, a[i]);
    printf("%d\n",mx);
    for(int i=mx;i>=1;i--)
    {
        // 特殊情况 只有一个点
        int st=1,ed=n;
        while(a[st] < i) st++;
        while(a[ed] < i) ed--;
        vector<Point> ans;
        if(st<ed)
        {
            ans.push_back(p[st]);
            for(int j=st+1;j<=ed;j++)
            {
                ans.push_back(mid[j]-v*i);
                if(a[j] >= i)
                    ans.push_back(p[j]);
                else 
                    ans.push_back(p[j] - v*i);
            };
        } else 
        {
            if(st==1)
            {
                ans.push_back(p[1]);
                ans.push_back(mid[2]-v*i);
            } else 
            {
                ans.push_back(mid[st]-v*i);
                ans.push_back(p[st]);
            }
        }
        printf("%u ",ans.size());
        for(auto pt:ans)
            printf("%.0Lf %.0Lf ",pt.x,pt.y);
        printf("\n");
    };
    return 0;
}