#include <bits/stdc++.h>
using namespace std;
void dfs(vector<int> &ans, bool &ok, int &cnt, vector<vector<vector<int>>> &ng, vector<int> &curr, int sz, int p){
  if (p == cnt){
    if (curr.size() == sz){
      auto itr = lower_bound(ng[sz].begin(), ng[sz].end(), curr);
      if (itr == ng[sz].end()){
        ans = curr;
        ok = true;
      } else if (*itr != curr){
        ans = curr;
        ok = true;
      }
    }
  } else {
    dfs(ans, ok, cnt, ng, curr, sz, p + 1);
    if (ok){
      return;
    }
    if (curr.size() < sz){
      curr.push_back(p);
      dfs(ans, ok, cnt, ng, curr, sz, p + 1);
      curr.pop_back();
    }
  }
}
int main(){
  int N;
  cin >> N;
  vector<int> m(N);
  vector<vector<int>> p(N), e(N);
  for (int i = 0; i < N; i++){
    cin >> m[i];
    p[i] = vector<int>(m[i]);
    e[i] = vector<int>(m[i]);
    for (int j = 0; j < m[i]; j++){
      cin >> p[i][j] >> e[i][j];
    }
  }
  vector<int> P;
  for (int i = 0; i < N; i++){
    for (int j = 0; j < m[i]; j++){
      P.push_back(p[i][j]);
    }
  }
  sort(P.begin(), P.end());
  P.erase(unique(P.begin(), P.end()), P.end());
  int cnt = P.size();
  for (int i = 0; i < N; i++){
    for (int j = 0; j < m[i]; j++){
      p[i][j] = lower_bound(P.begin(), P.end(), p[i][j]) - P.begin();
    }
  }
  vector<int> mx(cnt, -1);
  for (int i = 0; i < N; i++){
    for (int j = 0; j < m[i]; j++){
      mx[p[i][j]] = max(mx[p[i][j]], e[i][j]);
    }
  }
  vector<vector<int>> s(N);
  for (int i = 0; i < N; i++){
    for (int j = 0; j < m[i]; j++){
      if (mx[p[i][j]] == e[i][j]){
        s[i].push_back(p[i][j]);
      }
    }
  }
  bool ok = true;
  for (int i = 0; i < N; i++){
    if (s[i].size() == cnt){
      ok = false;
    }
  }
  if (!ok){
    cout << -1 << endl;
  } else {
    vector<vector<vector<int>>> ng(10);
    for (int i = 0; i < N; i++){
      int cnt2 = s[i].size();
      for (int j = 0; j < (1 << cnt2); j++){
        int sz = __builtin_popcount(j);
        vector<int> S2;
        for (int k = 0; k < cnt2; k++){
          if ((j >> k & 1) == 1){
            S2.push_back(s[i][k]);
          }
        }
        ng[sz].push_back(S2);
      }
    }
    for (int i = 0; i < 10; i++){
      sort(ng[i].begin(), ng[i].end());
      ng[i].erase(unique(ng[i].begin(), ng[i].end()), ng[i].end());
    }
    vector<int> ans;
    for (int i = 1; i <= 10; i++){
      vector<int> curr;
      bool ok2 = false;
      dfs(ans, ok2, cnt, ng, curr, i, 0);
      if (ok2){
        break;
      }
    }
    vector<int> A(N, 1);
    for (int i = 0; i < N; i++){
      for (int j = 0; j < m[i]; j++){
        for (int k = 0; k < e[i][j]; k++){
          A[i] *= P[p[i][j]];
        }
      }
    }
    int k = ans.size();
    vector<vector<int>> S(k);
    for (int i = 0; i < N; i++){
      for (int j = 0; j < k; j++){
        bool ok2 = true;
        int cnt2 = s[i].size();
        for (int l = 0; l < cnt2; l++){
          if (s[i][l] == ans[j]){
            ok2 = false;
          }
        }
        if (ok2){
          S[j].push_back(A[i]);
          break;
        }
      }
    }
    cout << k << endl;
    for (int i = 0; i < k; i++){
      int n = S[i].size();
      cout << n;
      for (int j = 0; j < n; j++){
        cout << ' ' << S[i][j];
      }
      cout << endl;
    }
  }
}