#include <bits/stdc++.h>
#include <utility>
using namespace std;
constexpr int N = 55;
int n;
struct node{
    int x, y;
    int nx, ny;
    int cnt;
};
constexpr int magicx = 10001, magicy = 2;
node a[N];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    int maxx = 0;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].x >> a[i].y >> a[i].cnt;
        a[i].nx = a[i].x + magicy * N + 1;
        a[i].ny = a[i].y - (magicx / magicy + 1) - magicx * N;
        maxx = max(maxx, a[i].cnt);
    }
    sort(a + 1, a + n + 1, [&](auto a, auto b) {
        return make_pair(a.x, a.y) < make_pair(b.x, b.y);
    });
    cout << maxx << "\n";
    while (maxx) {
        int cnt = 0;
        for (int i = 1; i <= n; i++)
            if (a[i].cnt == maxx)
                cnt++;
        cout << n + cnt << " ";
        for (int i = 1; i <= n; i++) {
            cout << a[i].nx << " " << a[i].ny << " ";
            a[i].nx -= magicy;
            a[i].ny += magicx;
            if (a[i].cnt == maxx) {
                cout << a[i].x << " " << a[i].y << " ";
                a[i].cnt--;
            }
        }
        cout << "\n";
        maxx--;
    }
}