#include <bits/stdc++.h>
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int &n, int b) { n |= two(b); }
inline void unset_bit(int &n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
long long int gcd(long long int a, long long int b) {
  return (a ? gcd(b % a, a) : b);
}
long long int modPow(long long int a, long long int b, long long int MOD) {
  long long int x = 1, y = a;
  while (b > 0) {
    if (b % 2 == 1) {
      x = (x * y) % MOD;
    }
    b /= 2;
    y = (y * y) % MOD;
  }
  return x;
}
long long int modInverse(long long int a, long long int p) {
  return modPow(a, p - 2, p);
}
using namespace std;
map<string, set<string> > name, ans;
bool isSuffix(string &s1, string &s2) {
  int ls2 = s2.size();
  int ls1 = s1.size();
  if (ls2 > ls1) return false;
  return (s1.substr(ls1 - ls2, ls1) == s2);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, i, j, k;
  string x, y;
  int ctr;
  cin >> n;
  for (i = (1); i <= (n); i++) {
    cin >> x;
    cin >> ctr;
    for (j = (1); j <= (ctr); j++) {
      cin >> y;
      name[x].insert(y);
    }
  }
  for (auto i : name) {
    set<string>::iterator itr1, itr2;
    for (itr1 = i.second.begin(); itr1 != i.second.end(); itr1++) {
      string str1 = *itr1;
      for (itr2 = i.second.begin(); itr2 != i.second.end(); itr2++) {
        if (itr1 == itr2) continue;
        string a = *itr1;
        string b = *itr2;
        if (isSuffix(b, a)) break;
      }
      if (itr2 == i.second.end()) ans[i.first].insert(*itr1);
    }
  }
  cout << ans.size() << endl;
  for (auto a : ans) {
    cout << a.first << " ";
    cout << a.second.size() << " ";
    for (auto b : a.second) cout << b << " ";
    cout << endl;
  }
}
