Can You Solve It?

First take a look at the following picture. In this picture, each circle has a coordinate according to Cartesian Coordinate System. You can move from one circle to another following the path denoted by the forward arrow symbols. To go from a source circle to a destination circle, the total number of steps needed is the number of intermediate circles you pass + 1. For example, to go from (0, 3) to (3, 0), you have to pass two intermediate circles (1, 2) and (2, 1). So, in this case, total number of steps needed is 2 + 1 = 3. In this problem, you are to calculate the number of steps needed for a given source circle and destination circle. You can assume that it is not possible to go back using the reverse direction of the arrows.

Input Specification

The first line of the input is the number of test cases n (0 < n ≤ 500) to handle. n lines follow, each containing four integers (0 ≤ each integer ≤ 100000), the first pair of which represents the coordinates of the source circle, and the other pair represents those of the destination circle. The first value of each pair is the x-coordinate, and the second is the y-coordinate.

Output Specification

For each pair of integers, your program should output the case number first and then the number of steps to reach the destination from the source. You may assume that it is always possible to reach the destination circle from the source circle.

Sample Input

1. 3
2. 0 0 0 1
3. 0 0 1 0
4. 0 0 0 2

download as text file

Output for Sample Input

1. Case 1: 1
2. Case 2: 2
3. Case 3: 3

download as text file