Little Vasya likes very much to play with sets consisting of positive integers. To make the game more interesting, Vasya chose _n_ non-empty sets in such a way, that no two of them have common elements.
One day he wanted to show his friends just how interesting playing with numbers is. For that he wrote out all possible unions of two different sets on _n_·(_n_ - 1) / 2 pieces of paper. Then he shuffled the pieces of paper. He had written out the numbers in the unions in an arbitrary order.
For example, if _n_ = 4, and the actual sets have the following form {1, 3}, {5}, {2, 4}, {7}, then the number of set pairs equals to six. The six pieces of paper can contain the following numbers:
* 2, 7, 4.
* 1, 7, 3;
* 5, 4, 2;
* 1, 3, 5;
* 3, 1, 2, 4;
* 5, 7.
Then Vasya showed the pieces of paper to his friends, but kept the _n_ sets secret from them. His friends managed to calculate which sets Vasya had thought of in the first place. And how about you, can you restore the sets by the given pieces of paper?
## Input
The first input file line contains a number _n_ (2 ≤ _n_ ≤ 200), _n_ is the number of sets at Vasya's disposal. Then follow sets of numbers from the pieces of paper written on _n_·(_n_ - 1) / 2 lines. Each set starts with the number _k__i_ (2 ≤ _k__i_ ≤ 200), which is the number of numbers written of the _i_\-th piece of paper, and then follow _k__i_ numbers _a__ij_ (1 ≤ _a__ij_ ≤ 200). All the numbers on the lines are separated by exactly one space. It is guaranteed that the input data is constructed according to the above given rules from _n_ non-intersecting sets.
## Output
Print on _n_ lines Vasya's sets' description. The first number on the line shows how many numbers the current set has. Then the set should be recorded by listing its elements. Separate the numbers by spaces. Each number and each set should be printed exactly once. Print the sets and the numbers in the sets in any order. If there are several answers to that problem, print any of them.
It is guaranteed that there is a solution.
[samples]
小瓦西亚非常喜欢玩由正整数组成的集合。为了使游戏更有趣，瓦西亚选择了 #cf_span[n] 个非空集合，使得其中任意两个集合都没有公共元素。
一天，他想向朋友们展示玩数字有多么有趣。为此，他将所有可能的两个不同集合的并集写在了 #cf_span[n·(n - 1) / 2] 张纸上。然后他把这些纸片打乱了顺序。他在每张纸上写出并集中数字时，顺序是任意的。
例如，如果 #cf_span[n = 4]，且实际的集合形式为 #cf_span[{1, 3}]、#cf_span[{5}]、#cf_span[{2, 4}]、#cf_span[{7}]，那么集合对的数量为六。六张纸上的数字可能如下所示：
随后，瓦西亚把纸片展示给朋友们，但没有告诉他们那 #cf_span[n] 个原始集合。他的朋友们成功地推断出了瓦西亚最初想的那些集合。那么你呢？你能根据给定的纸片恢复出原始集合吗？
输入的第一行包含一个数 #cf_span[n] (#cf_span[2 ≤ n ≤ 200])，#cf_span[n] 表示瓦西亚拥有的集合数量。接下来是 #cf_span[n·(n - 1) / 2] 行，每行代表一张纸上的数字集合。每行以一个数 #cf_span[ki] (#cf_span[2 ≤ ki ≤ 200]) 开头，表示第 #cf_span[i] 张纸上写的数字个数，接着是 #cf_span[ki] 个数字 #cf_span[aij] (#cf_span[1 ≤ aij ≤ 200])。行内所有数字之间恰好用一个空格分隔。保证输入数据是根据上述规则由 #cf_span[n] 个互不相交的集合构造而成的。
请在 #cf_span[n] 行中输出瓦西亚的原始集合描述。每行的第一个数表示当前集合包含的数字个数，随后列出该集合的所有元素，数字之间用空格分隔。每个数字和每个集合都必须恰好输出一次。集合以及集合中的数字可以按任意顺序输出。如果存在多个答案，输出任意一个即可。
保证存在解。
## Input
输入的第一行包含一个数 #cf_span[n] (#cf_span[2 ≤ n ≤ 200])，#cf_span[n] 表示瓦西亚拥有的集合数量。接下来是 #cf_span[n·(n - 1) / 2] 行，每行代表一张纸上的数字集合。每行以一个数 #cf_span[ki] (#cf_span[2 ≤ ki ≤ 200]) 开头，表示第 #cf_span[i] 张纸上写的数字个数，接着是 #cf_span[ki] 个数字 #cf_span[aij] (#cf_span[1 ≤ aij ≤ 200])。行内所有数字之间恰好用一个空格分隔。保证输入数据是根据上述规则由 #cf_span[n] 个互不相交的集合构造而成的。
## Output
请在 #cf_span[n] 行中输出瓦西亚的原始集合描述。每行的第一个数表示当前集合包含的数字个数，随后列出该集合的所有元素，数字之间用空格分隔。每个数字和每个集合都必须恰好输出一次。集合以及集合中的数字可以按任意顺序输出。如果存在多个答案，输出任意一个即可。保证存在解。
[samples]
**Definitions**
Let $ n \in \mathbb{Z} $, $ 2 \leq n \leq 200 $, be the number of disjoint non-empty sets.
Let $ \mathcal{S} = \{S_1, S_2, \dots, S_n\} $ be the unknown collection of pairwise disjoint sets.
Let $ \mathcal{P} = \{ S_i \cup S_j \mid 1 \leq i < j \leq n \} $ be the collection of all pairwise unions.
Let $ \mathcal{U} $ be the multiset of input sets, each given as a finite set of positive integers, such that $ |\mathcal{U}| = \binom{n}{2} $, and $ \mathcal{U} $ is exactly the set of all elements of $ \mathcal{P} $ (as sets, unordered).
**Constraints**
1. All sets in $ \mathcal{S} $ are pairwise disjoint: $ S_i \cap S_j = \emptyset $ for all $ i \ne j $.
2. Each set in $ \mathcal{U} $ is the union of exactly two distinct sets from $ \mathcal{S} $.
3. Every element in any set in $ \mathcal{U} $ belongs to exactly one set in $ \mathcal{S} $.
4. The input guarantees a unique solution up to permutation of sets.
**Objective**
Reconstruct the collection $ \mathcal{S} = \{S_1, S_2, \dots, S_n\} $ of $ n $ pairwise disjoint non-empty sets such that $ \mathcal{U} = \{ S_i \cup S_j \mid 1 \leq i < j \leq n \} $.
Output each set $ S_i $ as a line: first the size $ |S_i| $, then the elements of $ S_i $ in any order.