#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

// _________ vect (2D) ______________
template <typename T>
struct vect {
    T x = 0;
    T y = 0;

    vect() = default;
    vect(T x_, T y_) : x(x_), y(y_) {}

    inline T len2() const {
        return x * x + y * y;
    }

    inline ld len() const {
        return sqrtl(len2());
    }

    inline vect rotate() const {
        return vect(-y, x);
    }
};

template <typename T>
inline istream& operator>>(istream& in, vect<T>& v) {
    return in >> v.x >> v.y;
}

template <typename T>
inline ostream& operator<<(ostream& out, const vect<T>& v) {
    return out << "[" << v.x << "," << v.y << "]";
}

template <typename T>
inline vect<T> operator+(const vect<T>& a, const vect<T>& b) {
    return vect<T>(a.x + b.x, a.y + b.y);
}

template <typename T>
inline vect<T> operator-(const vect<T>& a, const vect<T>& b) {
    return vect<T>(a.x - b.x, a.y - b.y);
}

template <typename T>
inline vect<T> operator*(const vect<T>& a, T k) {
    return vect<T>(a.x * k, a.y * k);
}

template <typename T>
inline T operator*(const vect<T>& a, const vect<T>& b) {
    return a.x * b.x + a.y * b.y;
}

template <typename T>
inline T operator^(const vect<T>& a, const vect<T>& b) {
    return a.x * b.y - a.y * b.x;
}

bool check(vector<vect<ll>> v, vect<ll> base) {
    for (auto& t : v) {
        t = t - base;
    }
    sort(v.begin(), v.end(), [&](const auto& v1, const auto& v2) {
        return (v1 ^ v2) > 0;
    });
    for (int i = 0; i + 1 < (int)v.size(); i++) {
        if ((v[i] ^ v[i + 1]) == 0) {
            return false;
        }
    }
    return true;
}

mt19937 rnd(239);

void solve() {
    int n;
    cin >> n;
    vector<vect<ll>> v(n);
    vector<int> a(n);
    int mx = 0;
    int mnx = 0;
    int mny = 0;
    for (int i = 0; i < n; i++) {
        cin >> v[i] >> a[i];
        mx = max(mx, a[i]);
        mnx = min(mnx, (int)v[i].x);
        mny = min(mny, (int)v[i].y);
    }
    cout << mx << "\n";
    mnx -= 1;
    mny -= 1;
    vect<ll> base;
    bool found = false;
    for (int sz = 1; !found; sz *= 2) {
        for (int it = 0; it < 10 && !found; it++) {
            int x = mnx - (rnd() % sz);
            int y = mny - (rnd() % sz);
            if (check(v, vect<ll>(x, y))) {
                base = vect<ll>(x, y);
                found = true;
                break;
            }
        }
    }

    vector<int> order(n);
    iota(order.begin(), order.end(), 0);
    sort(order.begin(), order.end(), [&](int i, int j) {
        return ((v[i] - base) ^ (v[j] - base)) > 0;
    });

    vector<vect<ll>> btw;
    btw.emplace_back(vect<ll>(1, 0) + v[order[0]] - base);
    for (int i = 0; i < n - 1; i++) {
        btw.emplace_back((v[order[i]] - base) + (v[order[i + 1]] - base));
    }
    btw.emplace_back(v[order.back()] + vect<ll>(0, 1));

    const int CS = 2;
    for (auto& t : btw) {
        t.x *= CS;
        t.y *= CS;
    }
    vector<vect<ll>> go;
    for (int i = 0; i < n; i++) {
        go.emplace_back(v[i] - base);
    }

    for (int it = 1; it <= mx; it++) {
        for (int i = 0; i < n; i++) {
            if (a[i] <= 0) {
                v[i] = v[i] + go[i];
            }
        }
        for (int i = 0; i < n; i++) {
            a[i]--;
        }
        vector<vect<ll>> pt;
        for (int i = 0; i < n; i++) {
            auto v1 = btw[i] * (ll) it + base;
            pt.emplace_back(v1);
            pt.emplace_back(v[order[i]]);
        }
/*#ifdef ONPC
        for (int i = 0; i + 1 < (int)pt.size(); i++) {
            cout << "Segment ";
            cout << pt[i].x << " " << pt[i].y << " ";
            cout << pt[i + 1].x << " " << pt[i + 1].y << "\n";
        }
        for (int i = 0; i < (int)pt.size(); i++) {
            cout << pt[i].x << " " << pt[i].y << "\n";
        }
#endif*/
        cout << pt.size() << " ";
        for (const auto& t : pt) {
            cout << t.x << " " << t.y << " ";
        }
        cout << "\n";
    }
}

int main() {
#ifdef ONPC
    freopen("input", "r", stdin);
#endif
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}