#include <bits/stdc++.h>
using namespace std;
void print(map<string, vector<string> >& mp) {
  map<string, vector<string> >::iterator it;
  it = mp.begin();
  cout << mp.size() << endl;
  while (it != mp.end()) {
    vector<string>& vt = it->second;
    cout << it->first << " " << vt.size() << " ";
    for (int i = 0; i < vt.size(); i++) cout << vt[i] << " ";
    it++;
    cout << endl;
  }
}
int main() {
  int n;
  cin >> n;
  map<string, vector<string> > mp;
  map<string, vector<string> >::iterator it;
  vector<string>::iterator it1;
  string s, x;
  int m;
  while (n--) {
    cin >> s;
    int m;
    cin >> m;
    for (int i = 0; i < m; i++) {
      cin >> x;
      mp[s].push_back(x);
    }
  }
  it = mp.begin();
  while (it != mp.end()) {
    vector<string>& vt = it->second;
    sort(vt.begin(), vt.end());
    for (int i = 1; i < vt.size();) {
      if (vt[i] == vt[i - 1])
        vt.erase(vt.begin() + i - 1);
      else
        i++;
    }
    int fg = 0, k1 = 0, k2 = 0;
    for (int i = 0; i < vt.size();) {
      for (int j = i + 1; j < vt.size();) {
        k1 = vt[i].size() - 1;
        k2 = vt[j].size() - 1;
        while (k1 >= 0 && k2 >= 0) {
          if (vt[i][k1] == vt[j][k2]) {
            k1--;
            k2--;
          } else
            break;
        }
        if (k2 < 0) {
          it1 = vt.begin() + j;
          vt.erase(vt.begin() + j);
        } else
          j++;
        if (k1 < 0) {
          fg = 1;
          break;
        }
      }
      if (fg) {
        vt.erase(vt.begin() + i);
        fg = 0;
      } else
        i++;
    }
    it++;
  }
  print(mp);
  return 0;
}
