#include <bits/stdc++.h>
using namespace std;
set<string> S[30];
vector<string> V[30], ans[30];
map<string, int> MP;
map<int, string> Rev;
bool cmp(string s1, string s2) { return s1.size() > s2.size(); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  int cur = 0;
  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    if (MP.find(s) == MP.end()) {
      MP[s] = ++cur;
      Rev[cur] = s;
    }
    int x;
    cin >> x;
    for (int i = 0; i < x; i++) {
      string str;
      cin >> str;
      S[MP[s]].insert(str);
    }
  }
  for (int i = 1; i <= cur; i++) {
    for (auto it : S[i]) {
      V[i].push_back(it);
    }
    sort(V[i].begin(), V[i].end(), cmp);
    reverse(V[i].begin(), V[i].end());
  }
  for (int i = 1; i <= cur; i++) {
    for (int j = 0; j < V[i].size(); j++) {
      string s = V[i][j];
      bool T = false;
      for (int k = 0; k < V[i].size(); k++) {
        if (j == k) {
          continue;
        }
        bool f = false;
        string s2 = V[i][k];
        int sz = s2.size() - 1;
        for (int l = sz, len = 1; l >= 0; l--, len++) {
          if (s2.substr(l, len) == s) {
            f = true;
            break;
          }
        }
        if (f) {
          T = true;
          break;
        }
      }
      if (!T) {
        ans[i].push_back(s);
      }
    }
  }
  cout << cur << endl;
  for (int i = 1; i <= cur; i++) {
    cout << Rev[i] << " " << ans[i].size() << " ";
    for (auto it : ans[i]) {
      cout << it << " ";
    }
    cout << endl;
  }
  return 0;
}
