Counting Sheep

After a long night of coding, Charles Pearson Peterson is having trouble sleeping. This is not only because he is still thinking about the problem he is working on, but also because he drank too much java during the wee hours. This happens frequently, so Charles has developed a routine to count sheep — not the animal, but the word. Specifically, he thinks of a list of words, many of which are close in spelling to "sheep", and then counts how many of them are exactly the word "sheep". Charles is always careful to match case-sensitively, so "Sheep" is not a match. Write a program that helps Charles count "sheep".

The input consists of multiple problem instances. The first line contains a single positive integer $n \le 20$, the number of problem instances. Each problem instance is given on two lines. The first line contains a positive integer $m \le 10$, and the second line contains $m$ words separated by single spaces, each word containing no more than 10 characters.

For each problem instance, print one line in the following format:

Case i: This list contains n sheep.

Here $i$ is the number of the problem instance (numbering starts at 1) and $n$ is the number of times the word "sheep" appears in that instance's list of words. Separate consecutive output lines with a single blank line.