//Test
//source code by ckiseki, https://qoj.ac/submission/245019

#include <bits/stdc++.h>
using namespace std;

constexpr int R = 1'000'000'000;

using ll = int64_t;

void exgcd(ll x, ll y, ll &a, ll &b) {
  if (y == 0) a = 1, b = 0;
  else exgcd(y, x % y, b, a), b -= (x / y) * a;
}

pair<ll, ll> MakeMid(ll a, ll b, ll v) { //ax + by = v
  ll x, y;
  exgcd(a, b, x, y);
  // ll vv = v % abs(a);
  x *= v, y *= v;
  return {x, y};
  // return {x + v / abs(a), y};
}

int main() {
  mt19937 rnd(7122);
  uniform_int_distribution<ll> C(-10'000, 10'000);
  int n;
  cin >> n;
  if (n == 1) {
    int x, y, c;
    cin >> x >> y >> c;
    cout << c << '\n';
    for (int i = 0; i < c; ++i) {
      cout << 2 << ' ' << x << ' ' << y;
      cout << ' ' << x + i  << ' ' << y + i + 1 << '\n';
    }
    return 0;
  }
  vector<tuple<ll, ll, int>> v_(n);
  for (auto &[x, y, c] : v_)
    cin >> x >> y >> c;
  while (true) {
    ll a = C(rnd), b = C(rnd);
    if (a == 0 and b == 0)
      continue;
    ll g = gcd(abs(a), abs(b));
    a /= g, b /= g;

    auto v = v_;

    auto f = [&](ll x, ll y) {
      return a * x + b * y;
    };

    sort(v.begin(), v.end(), [&](const auto &lhs, const auto &rhs) {
      return f(get<0>(lhs), get<1>(lhs)) < f(get<0>(rhs), get<1>(rhs));
    });
    bool valid = true;
    for (int i = 1; i < n; ++i) {
      valid &= f(get<0>(v[i]), get<1>(v[i])) - f(get<0>(v[i - 1]), get<1>(v[i - 1])) > 1;
    }
    if (not valid)
      continue;

    vector<pair<ll, ll>> mid;
    for (int i = 0; i + 1 < n; ++i) {
      const auto [x1, y1, _] = v[i];
      ll fv = f(x1, y1) + 1;
      auto [x2, y2] = MakeMid(a, b, fv);
      mid.emplace_back(x2, y2);
    }
    vector<vector<pair<ll, ll>>> ans;
    while (true) {
      bool all0 = true;
      for (auto [_, __, c] : v)
        all0 &= c == 0;
      if (all0)
        break;
      ans.push_back({});
      for (int i = 0; i < n; ++i) {
        auto &[x, y, c] = v[i];
        if (c == 0) { 
          x -= b, y += a;
        } else {
          c -= 1;
        }
        ans.back().emplace_back(x, y);
        if (i + 1 < n) {
          ans.back().push_back(mid[i]);
          mid[i].first -= b;
          mid[i].second += a;
        }
      }
    }
    for (const auto &ansi : ans) {
      for (auto [x, y] : ansi) {
        valid &= -R <= x and x <= R;
        valid &= -R <= y and y <= R;
      }
    }
    // if (not valid)
      // continue;
    cout << ans.size() << '\n';
    for (const auto &ansi : ans) {
      cout << ansi.size();
      for (auto [x, y] : ansi) {
        cout << ' ' << x << ' ' << y;
      }
      cout << '\n';

    }
    break;
  }
  return 0;
}