#include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;


constexpr long long THRES = 1000000000;

int main() {
    cin.tie(nullptr), ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<int> A(N, 1);
    vector<map<int, int>> facA(N);

    map<int, int> lcmall;
    vector<int> ps;
    for (int i = 0; i < N; ++i) {
        int m;
        cin >> m;
        while (m--) {
            int p, e;
            cin >> p >> e;
            ps.push_back(p);
            facA[i][p] = e;
            if (lcmall[p] < e) lcmall[p] = e;
            while (e--) A[i] *= p;
        }
    }

    for (const auto &mp : facA) {
        if (mp.size() == lcmall.size() and mp == lcmall) {
            puts("-1");
            return 0;
        }
    }

    sort(ps.begin(), ps.end());
    ps.erase(unique(ps.begin(), ps.end()), ps.end());

    unordered_set<long long> pgs;

    for (int i = 0; i < N; ++i) {
        vector<int> pvs;
        for (auto [p, d] : facA[i]) {
            if (lcmall[p] == d) pvs.push_back(p);
        }
        for (int s = 1; s < 1 << pvs.size(); s++) {
            int v = 1;
            for (int j = 0; j < int(pvs.size()); ++j) {
                if ((s >> j) & 1) {
                    v *= pvs[j];
                    if (v > THRES) break;
                }
            }
            pgs.insert(v);
        }
    }

    auto build = [&](const vector<int> &P) {
        vector<vector<int>> ret(P.size());
        for (int i = 0; i < N; ++i) {
            for (int g = 0; g < int(P.size()); ++g) {
                const int &p = P[g];
                if (facA[i][p] < lcmall[p]) {
                    ret[g].push_back(A[i]);
                    break;
                }
            }
        }
        cout << ret.size() << '\n';
        for (const auto &v : ret) {
            cout << v.size();
            for (auto x : v) cout << ' ' << x;
            cout << '\n';
        }
        exit(0);
    };

    if (ps.size() >= 2 and (long long)(ps.back()) * ps[ps.size() - 2] > *max_element(A.begin(), A.end())) {
        build({ps.back(), ps[ps.size() - 2]});
    }

    for (int num = 2;; ++num) {
        vector<int> ans(num);
        auto rec = [&](auto &&self, int sz, int nl, long long prod) -> void {
            if (sz == num) {
                if (pgs.count(prod)) return;
                build(ans);
            }
            if (prod > THRES) return;
            for (int i = nl; i < int(ps.size()); ++i) {
                ans[sz] = ps[i];
                self(self, sz + 1, i + 1, prod * ps[i]);
            }
        };
        rec(rec, 0, 0, 1);
    }
}