URI Online Judge | 2205
# Asteroid Rangers

**Timelimit: 30**

By ICPC 2012 World Finals Poland

The year is 2112 and humankind has conquered the solar system. The Space Ranger Corps have set up bases on any hunk of rock that is even remotely inhabitable. Your job as a member of the Asteroid Communications Ministry is to make sure that all of the Space Ranger asteroid bases can communicate with one another as cheaply as possible. You could set up direct communication links from each base to every other base, but that would be prohibitively expensive. Instead, you want to set up the minimum number of links so that everyone can send messages to everyone else, potentially relayed by one or more bases. The cost of any link is directly proportional to the distance between the two bases it connects, so this doesn’t seem that hard of a problem.

There is one small difficulty, however. Asteroids have a tendency to move about, so two bases that are currently very close may not be so in the future. Therefore as time goes on, you must be willing to switch your communication links so that you always have the cheapest relay system in place. Switching these links takes time and money, so you are interested in knowing how many times you will have to perform such a switch.

A few assumptions make your task easier. Each asteroid is considered a single point. Asteroids always move linearly with a fixed velocity. No asteroids ever collide with other asteroids. Also, any relay system that becomes optimal at a time **t** ≥ 0 will be uniquely optimal for any time **s** satisfying **t** < **s** < t+10^{−6} . The initial optimal relay system will be unique.

Each test case starts with a line containing an integer **n** (2 ≤ **n** ≤ 50) indicating the number of asteroid bases. Following this are **n** lines, each containing six integers **x**, **y**, **z**, **v _{x}**,

For each test case, display a single line containing the case number and the number of times that the relay system needs to be set up or modified.

Input Sample | Output Sample |

3 0 0 0 0 0 0 5 0 0 0 0 0 10 1 0 -1 0 0 4 0 0 0 1 0 0 0 1 0 0 -1 0 1 1 1 3 1 1 -1 -1 2 1 -1 -1 |
Case 1: 3 Case 2: 3 |