Problem Description
The football, well known as a worldwide popular sport, is made of 12 regular pentagons and 20 regular hexagons.
In this problem, L has to color a new football. The football is totally white in the beginning and L has to color some of its faces into black (maybe zero). Look at the picture below, the 32 faces of a football are numbered from 1 to 32. Two faces are considered connected if and only if they share a same side such like 12 and 13 as well as 29 and 30. Each step L can choose some connected faces of the football and color all these faces into black or white no matter what color it used to be. For example, L can color the faces 2, 3, 4 and 5 at the same time, but he can’t color the faces 26 and 29 at the same time.
Now give the target state of the football, your task is calculating the minimum steps that L needs to do.
Input
The first line of the date is an integer T, which is the number of the text cases.
Then T cases follow describe a target state. Each case contains 32 integers in a line. If the ith number in this line is 1, it means that the face with index i need to color to black, otherwise it need to color to white.
Output
For each test case, output the case number first, then output minimum steps L needs to do to color the football to the target state.
Sample Input
2
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
0 0 1 0 0 1 1 0 0 0 1 0 1 1 0 0 0 1 0 0 1 0 1 0 0 1 0 0 1 0 0 1
Sample Output
Case 1: 1
Case 2: 2
