JMU F18 Week 4

Start

2018-09-21 18:30 UTC

JMU F18 Week 4

End

2018-09-27 20:00 UTC
The end is near!
Contest is over.
Not yet started.
Contest is starting in -53 days 1:39:34

Time elapsed

145:30:00

Time remaining

0:00:00

Problem B
Un-bear-able Zoo

/problems/zoo/file/statement/en/img-0001.jpg
In his free time, when he’s not busy hacking computers, Dr. Back runs a zoo. Every morning he gets up and makes sure that none of the animals have escaped. He has a huge list of all the animals and checks each animal off as he sees it, but thinks this is really inefficient. He only cares about what animal they are, since all similar animals share a cage. So, if he has a white tiger and a siberian tiger, Dr. Back only wants to know that he has $2$ tigers.

Given an integer $n$, and $n$ lines describing animals, output in alphabetical order the animals Dr. Back has in his zoo, followed by their count.

Input

The input will contain multiple test cases, up to $5$. Each test case contains a line containing a single integer $n$ ($0 \le n \le 10^{3}$), followed by $n$ lines of animals with at least one word on every line. An animal name may consist of multiple lowercase or uppercase words, with the last one describing the kind of animal. Animal names may contain apostrophes, hyphens, and periods; e.g., St. Vincent’s Agouti would be a valid animal name. The input is terminated when $n$ is $0$.

Output

For each test case, output the list number, followed by the animals Dr. Back has in his zoo in lowercase and alphabetical order, with each animal followed by one space and the delimiter | and then another space and their count.

Sample Input 1 Sample Output 1
6
African elephant
White tiger
Indian elephant
Siberian tiger
Tiger
Panda bear
1
Blue Russian Penguin
0
List 1:
bear | 1
elephant | 2
tiger | 3
List 2:
penguin | 1