#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <random>
#include <stdio.h>
#include <fstream>
#include <functional>
#include <cassert>
#include <unordered_set>

using namespace std;

#define rep(i,n,c) for (int i=0;i<n;i+=c)
#define append push_back
#define all(x) (x).begin(), (x).end()

template<class T>
using vec = vector<T>;
template<class T>
using vvec = vec<vec<T>>;
template<class T>
using vvvec = vec<vvec<T>>;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;


template<class T>
bool chmin(T &a, T b){
  if (a>b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
bool chmax(T &a, T b){
  if (a<b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
T sum(vec<T> x){
  T res=0;
  for (auto e:x){
    res += e;
  }
  return res;
}

template<class T>
void printv(vec<T> x){
  for (auto e:x){
    cout<<e<<" ";
  }
  cout<<"\n";
}

int pow(int n,int k){
  int res = 1;
  while (k){
    if (k&1){
      res *= n;
    }
    n *= n;
    k >>= 1;
  }
  return res;
}

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int N;
  cin>>N;

  map<int,int> LCM;
  vec<int> A(N,1);
  unordered_set<ll> all_divisors;

  int m,p,e,t;
  for (int i=0;i<N;i++){
    cin>>m;
    vec<int> D = {1};
    for (int x=0;x<m;x++){
      cin>>p>>e;
      t = pow(p,e);
      A[i] *= t;
      LCM[p];
      chmax(LCM[p],t);

      vec<int> nD;
      for (auto d:D){
        nD.append(d);
        nD.append(d*t);
      }
      D = nD;
    }
    for (auto d:D){
      all_divisors.insert((ll)d);
    }
  }

  vec<int> P;
  for (auto [p,pe]:LCM){
    P.append(pe);
  }
  int n = P.size();

  deque<pair<ll,int>> deq = {{1,-1}};
  ll prod = -1;
  while (!deq.empty()){
    auto [v,k] = deq.front();
    deq.pop_front();
    if (!all_divisors.count(v)){
      prod = v;
      break;
    }
    for (int i=k+1;i<n;i++){
      if (v*P[i] <= 1000000000){
        deq.append({v*P[i],i});
      }
      else{
        break;
      }
    }
  }

  if (prod==-1){
    cout<<-1<<endl;
    return 0;
  }

  vec<int> selected_P;
  for (int i=0;i<n;i++){
    if (prod%P[i]==0){
      selected_P.append(P[i]);
    }
  }
  int k = selected_P.size();

  vec<vec<int>> S(k,vec<int>(0));
  for (int i=0;i<N;i++){
    for (int j=0;j<k;j++){
      if (A[i]%selected_P[j]){
        S[j].append(A[i]);
        break;
      }
    }
  }

  cout<<k<<endl;
  for (int i=0;i<k;i++){
    cout<<S[i].size()<<" ";
    printv(S[i]);
  }

  
}