#include<bits/stdc++.h>
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ "="),debug_helper::debug(__VA_ARGS__),D("\n")
#include"/home/xay5421/debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define each(x,v) for(auto&x:v)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
template<class T>void rd(T&x){int f=0,c;while(!isdigit(c=getchar()))f^=!(c^45);x=(c&15);while(isdigit(c=getchar()))x=x*10+(c&15);if(f)x=-x;}
template<class T>void pt(T x,int c=-1){if(x<0)putchar('-'),x=-x;if(x>9)pt(x/10);putchar(x%10+48);if(c!=-1)putchar(c);}
using namespace std;
using LL=long long;
using ULL=unsigned long long;
const int N=55;
// mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
mt19937 rng(0);
int brand(){return rng()&0X7FFFFFFF;}
int n,cur[N];
struct vec{
	int x,y,tt;
	vec operator-(const vec&rhs)const{return (vec){x-rhs.x,y-rhs.y,0};}
	vec operator+(const vec&rhs)const{return (vec){x+rhs.x,y+rhs.y,0};}
	vec operator*(const int&k)const{return (vec){x*k,y*k,0};}
}a[N],w[N];
LL cross(vec a,vec b){return 1LL*a.x*b.y-1LL*a.y*b.x;}
vec Get(vec a,vec b){
	return a+b;
}
int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	rd(n);
	int ans=0;
	rep(i,1,n){
		rd(a[i].x),rd(a[i].y),rd(a[i].tt);
		ans=max(ans,a[i].tt);
	}
	if(n==1){
		printf("%d\n",ans);
		rep(i,1,ans){
			printf("2 %d %d %d %d\n",a[1].x,a[1].y,a[1].x+1,a[1].y+i);
		}
		return 0;
	}
	vec bg;
	auto test=[&](){
		rep(i,1,n){
			rep(j,i+1,n){
				if(cross(a[i]-bg,a[j]-bg)==0){
					return 0;
				}
			}
		}
		return 1;
	};
	while(1){
		bg=(vec){-1001-brand()%1000,-1001-brand()%1000};
		if(test())break;
	}
	sort(a+1,a+n+1,[&](vec a,vec b){return cross(a-bg,b-bg)>0;});
	rep(i,1,n-1){
		w[i]=Get(a[i]-bg,a[i+1]-bg);
	}
	rep(i,1,n){
		cur[i]=0;
	}
	printf("%d\n",ans);
	rep(_,1,ans){
		vector<vec>v;
		rep(i,1,n){
			if(a[i].tt){
				--a[i].tt;
				v.pb(a[i]);
			}else{
				++cur[i];
				v.pb(a[i]+(a[i]-bg)*cur[i]);
			}
			if(i<n){
				v.pb(bg+w[i]*_);
			}
		}
		printf("%d ",SZ(v));
		for(auto&[x,y,z]:v)printf("%d %d ",x,y);
		puts("");
	}
	return 0;
}