Travelling Salesman

Bob Smith has to tour New Zealand to visit his company's customers. The company database produces a list of the towns where each customer lives, but because it is poorly written, the same town may appear more than once. Help Bob by removing the duplicate towns and reporting how many towns he actually has to visit.

The input consists of several lists, each representing one week of visits. The first line of each week is a single integer $N$ ($1 < N \le 100$), the number of towns in that week's list. The input is terminated by $N = 0$, and that final week is not processed.

Each week is followed by $N$ town names, one per line. A town name may consist of more than one word. The first letter of each word is upper case and every other letter is lower case. A town name contains at most 20 characters.

Print one line for each week. Each line contains the word Week, a space, the week number (the first week is 1), a space, and finally the actual number of towns to visit after duplicates have been removed.