**Problem Description**

She turns to you to write a program to help her.

**Input**

There will be multiple test cases for this problem. Each test case will have input on multiple lines. The first line will contain the integer n (< 10) noting the number of places Granny wants to visit that day. These will be numbered 1 through n and Granny's house will be numbered 0. The next n lines will be a list of those places near each spot. The first line will be a list of places with a direct route from place 1. The second line will be a list of places with a direct route from place 2, and so on. You may assume that if place i has a direct route to place j, then there is a direct route the other direction also. A line containing 0 will follow the last test case.

**Output**

For each test case, print one line of the form:

Case m: Granny can make the circuit.

or

Case m: Granny can not make the circuit.

as appropriate. Here, m is the number of the test case, starting at 1.

**Sample Input**

5 0 2 5 0 1 3 2 4 0 3 5 1 4 4 0 2 3 4 1 3 1 2 0 1 0

**Sample Output**

Case 1: Granny can make the circuit. Case 2: Granny can not make the circuit.

**Source**

East Central North America 2003, Practice