#include<bits/stdc++.h>
using namespace std;
const int B = 10001, hf = 5001;
int main(){
	int n;
	cin >> n;
	vector<tuple<int, int, int>> a(n + 5);
	int maxa = 0;
	for (int i = 1; i <= n; i++){
		int x, y, c;
		cin >> x >> y >> c;
		maxa = max(maxa, c);
		a[i] = { x,y,c };
	}
	sort(a.begin() + 1, a.begin() + n + 1);
	vector<vector<pair<int, int>>> lines(maxa);
	for (int k = 0; k < maxa; k++){
		for (int i = 1; i <= n; i++){
			auto [x, y, c] = a[i];
			if (k < c){
				lines[k].emplace_back(x, y);
			}
			lines[k].emplace_back(x - 1 - k * 2, y + hf + k * B);
		}
	}
	cout << lines.size() << endl;
	for (auto& line : lines){
		cout << line.size();
		for (auto [x, y] : line) {
			cout << ' ' << x << ' ' << y;
		}
		cout << endl;
	}
	return 0;
}