Problem: Vasya has several phone books, in which he recorded the telephone numbers of his friends. Each of his friends can have one or several phone numbers.

Vasya decided to organize information about the phone numbers of friends. You will be given n strings — all entries from Vasya's phone books. Each entry starts with a friend's name. Then follows the number of phone numbers in the current entry, and then the phone numbers themselves. It is possible that several identical phones are recorded in the same record.

Vasya also believes that if the phone number a is a suffix of the phone number b (that is, the number b ends up with a), and both numbers are written by Vasya as the phone numbers of the same person, then a is recorded without the city code and it should not be taken into account.

The task is to print organized information about the phone numbers of Vasya's friends. It is possible that two different people have the same number. If one person has two numbers x and y, and x is a suffix of y (that is, y ends in x), then you shouldn't print number x. If the number of a friend in the Vasya's phone books is recorded several times in the same format, it is necessary to take it into account exactly once.

Read the examples to understand statement and format of the output better.

Input

First line contains the integer n (1 ≤ n ≤ 20) — number of entries in Vasya's phone books. 

The following n lines are followed by descriptions of the records in the format described in statement. Names of Vasya's friends are non-empty strings whose length does not exceed 10. They consists only of lowercase English letters. Number of phone numbers in one entry is not less than 1 is not more than 10. The telephone numbers consist of digits only. If you represent a phone number as a string, then its length will be in range from 1 to 10. Phone numbers can contain leading zeros.

Output

Print out the ordered information about the phone numbers of Vasya's friends. First output m — number of friends that are found in Vasya's phone books.

The following m lines must contain entries in the following format "name number_of_phone_numbers phone_numbers". Phone numbers should be separated by a space. Each record must contain all the phone numbers of current friend.

Entries can be displayed in arbitrary order, phone numbers for one record can also be printed in arbitrary order.

Examples

Input

2
ivan 1 00123
masha 1 00123


Output

2
masha 1 00123 
ivan 1 00123 


Input

3
karl 2 612 12
petr 1 12
katya 1 612


Output

3
katya 1 612 
petr 1 12 
karl 1 612 


Input

4
ivan 3 123 123 456
ivan 2 456 456
ivan 8 789 3 23 6 56 9 89 2
dasha 2 23 789


Output

2
dasha 2 23 789 
ivan 4 789 123 2 456 

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class File {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Map<String, Set<String>> map = new HashMap<>();

        for (int i = 0; i < n; i++) {
            String name = sc.next();

            if (!map.containsKey(name)) {
                map.put(name, new HashSet<>());
            }

            int numbers = sc.nextInt();
            for (int j = 0; j < numbers; j++) {
                map.get(name).add(sc.next());
            }
        }

        Map<String, List<String>> resMap = new HashMap<>();
        for (String name : map.keySet()) {
            resMap.put(name, new ArrayList<>());
            List<String> currList = new ArrayList<>(map.get(name));
            
            Collections.sort(currList, new Comparator<String>() {
                @Override
                public int compare(String a, String b) {
                    return a.length() - b.length();
                }
            });

            for (int i = 0; i + 1 < currList.size(); i++) {
                boolean canAdd = true;

                for (int j = i + 1; j < currList.size(); j++) {
                    if (isSuffix(currList.get(i), currList.get(j))) {
                        canAdd = false;
                        break;
                    }
                }

                if (canAdd) {
                    resMap.get(name).add(currList.get(i));
                }
            }
            
            resMap.get(name).add(currList.get(currList.size() - 1));
        }

        System.out.println(resMap.size());

        for (String name : resMap.keySet()) {
            System.out.print(name + " ");
            System.out.print(resMap.get(name).size() + " ");
            for (String number : resMap.get(name)) {
                System.out.print(number + " ");
            }

            System.out.println();
        }
    }

    // Return true if s is a suffix of t
    public static boolean isSuffix(String s, String t) {
        int i = s.length() - 1;
        int j = t.length() - 1;

        while (i >= 0 && j >= 0) {
            if (s.charAt(i) != t.charAt(j)) {
                return false;
            }
            else {
                i--;
                j--;
            }
        }

        return true;
    }
}