#include<stdio.h>
#include<algorithm>
typedef long long ll;
constexpr int dx{1},dy{10007};
struct point {
    int x,y,c;
    constexpr int eval() const {
        return x*dx+y*dy;
    }
};
point a[55],b[55],c[55];
int main() {
    int n;
    scanf("%d",&n);
    int m(0);
    for(int i=1;i<=n;i++) {
        scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].c);
        m=std::max(m,a[i].c);
    }
    std::sort(a+1,a+n+1,[&](const point &x,const point &y)->bool {
        return x.eval()<y.eval();
    });
    for(int i=1;i<=n;i++) {
        const int v0(a[i].eval());
        ll x(ll(dy/dx+1)*(v0+1)),y(-v0-1);
        const ll k(x/dy);
        x-=k*dy,y+=k*dx;
        c[i]={int(x),int(y),0};
    }
    printf("%d\n",m);
    for(int i=1;i<=m;i++) {
        for(int j=1;j<=n;j++) {
            if(a[j].c) {
                b[j]=a[j],--a[j].c;
            }
            else {
                b[j]={a[j].x+dy,a[j].y-dx,0};
            }
        }
        printf("%d ",n*2);
        for(int i=1;i<=n;i++) {
            printf("%d %d ",b[i].x,b[i].y);
            printf("%d %d%c",c[i].x,c[i].y,i==n?'\n':' ');
            c[i].x+=dy,c[i].y-=dx;
        }
    }
    return 0;
}