Description

There used to be a gambling called Bohemian Gambling. At the beginning of the game, a unit circle was drawn on a piece of paper. Then a point (x₀, y₀) in the circle and N (1 ≤ N ≤ 1000) vectors (Δx_i, Δy_i) were randomly chosen. At the i-th step of the gambling, a player draw a segment from the point (x_{i − 1}, y_{i − 1}) to (x_i, y_i), where x_i = x_{i − 1} + Δx_i and y_i = y_{i − 1} + Δy_i. If (x_i, y_i) was outside the circle or on its boundary, the game ended; otherwise the player would win some money and go on to the next step of the gambling until all N lines had been drawn.

As a predictor, Mercury had known all the vectors chosen for the gambling in advance, but he didn't know what the starting point would be. His clients asked him to find how much money they could win under average conditions, which meant the point would be chosen within the circle with uniformly distributed probability. They also wondered how much they could win if everything went the luckiest way. What would Mercury's reply to his clients be?

Input

The input consists of one or more data sets, followed by a last line containing a single zero. Each data set begins with a line containing an integer

, 1 ≤

≤ 500, which is the number of line segments that would be drawn. Then follow

lines, each containing two real numbers and an integer referring to Δ

, Δ

and the money that a player could win after the

-th step.

Output

For each test case your program should output two lines. The first line gives a real number which indicates the money a player can win under average conditions and the second line an integer number which indicates the maximum amount of money he could win. Refer to the sample output for details.

The real numbers should be rounded to three digits after the decimal point.

2 
1.0 1.0 100
-1.0 -1.0 50
0

Case 1:
The expected amount of money: 27.254
The maximum amount of money: 150

Source

, TN@PKU_RPWT