You are studying the history of the Great Wall of China, which was built by the Chinese to protect against military incursions from the North. For the purposes of this problem, the Great Wall stretches from infinity in the East to minus infinity in the West. As this is a lot of distance to cover, the Great Wall was not built at once. Instead, for this problem we assume that the builder used a reactive strategy: whenever a part of the border was attacked successfully, the Wall on this part of the border would be raised to the height sufficient to stop an identical attack in the future.
The north border of China was frequently attacked by nomadic tribes. For the purposes of this problem, we assume that each tribe attacks the border on some interval with some strength S. In order to repel the attack, the Wall must have height S all along the defended interval. If even a short stretch of the Wall is lower than needed, the attack will breach the Wall at this point and succeed. Note that even a successful attack does not damage the Wall. After the attack, every attacked fragment of the Wall that was lower than S is raised to height S — in other words, the Wall is increased in the minimal way that would have stopped the attack. Note that if two or more attacks happened on the exact same day, the Wall was raised only after they all resolved, and is raised in the minimum way that would stop all of them.
Since nomadic tribes are nomadic, they did not necessarily restrict themselves to a single attack. Instead, they tended to move (either to the East or to the West), and periodically attack the Wall. To simplify the problem, we assume they moved with constant speed and attacked the Wall at constant intervals; moreover we assume that the strength with which a given tribe attacked the Wall changed by a constant amount after each attack (either decreased from attrition, or grew from experience).
Assuming that initially (in 250 BC) the Wall was nonexistent (i.e., of height zero everywhere), and given the full description of all the nomadic tribes that attacked the Wall, determine how many of the attacks were successful.
The first line of the input gives the number of test cases, T. T test cases follow. Each test case begins with a line containing a single integer N: the number of the tribes attacking the Wall. N lines follow, each describing one tribe. The ith line contains eight integers d_{i}, n_{i}, w_{i}, e_{i}, s_{i}, delta_d_{i}, delta_p_{i} and delta_s_{i} separated by spaces, describing a single nomadic tribe:
For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is the number of attacks that succeed.
1 ≤ T ≤ 20.
0 ≤ d_{i}.
1 ≤ delta_d_{i} ≤ 676060.
d_{i} + (n_{i}  1) * delta_d_{i} ≤ 676060.
1 ≤ s_{i} ≤ 10^{6}.
10^{5} ≤ delta_s_{i} ≤ 10^{5}.
s_{i} + (n_{i}  1) * delta_s_{i} ≥ 1.
1 ≤ N ≤ 10.
1 ≤ n_{i} ≤ 10.
100 ≤ w_{i} < e_{i} ≤ 100.
10 ≤ delta_p_{i} ≤ 10.
1 ≤ N ≤ 1000.
1 ≤ n_{i} ≤ 1000.
10^{6} ≤ w_{i} < e_{i} ≤ 10^{6}.
10^{5} ≤ delta_p_{i} ≤ 10^{5}.
Input 
Output 
2

Case #1: 5

In the first case, the first tribe attacks three times: on day 0 it hits the interval [0,2] at height 10, on day 2 it hits [3,5] at height 8 and on day 4 it hits [6,8] at height 6; all three attacks succeed. Then the second tribe attacks three times, each time at height 8  on day 10 it hits [2,3] (this succeeds, for example at position 2.5, where the Wall has still height 0), on day 17 it hits [4,5] (this fails, the Wall is already of height 8 in the interval [3, 5], which covers [4, 5]), and on day 24 it hits [6,7] (this succeeds, as the Wall there was of height 6).
In the second case there are three tribes, and their attacks intermingle. The sequence is as follows: