# Problem A: Leaps Tall Buildings (in a single bound)

*It's a bird! It's a plane! It's coming right at us!*

Although it sometimes seems like it, Superman can't fly (without a plane).
Instead, he makes super-human leaps, especially over tall buildings.
Since he never knows when he will need to catch a criminal, he can't
register flight paths. To avoid hitting planes, he tries to keep his
jumps as low to the ground as he can. Given a city-scape as input, find
the angle and velocity of Superman's jump that minimizes his maximum
altitude.

Recall that gravity provides an acceleration of 9.8 m/s^{2}
downwards and
the formula for Superman's vertical distance from his starting
location is
`d(t)`=`v` `t` + 0.5 `a` `t`^{2}
where `v` is his initial velocity, `a` is his acceleration and `t` is time in
seconds since the start of the leap.

## Input:

Input consists of a sequence of city-scapes, each of the form

`n`

0 `d`_{1}

`h`_{2} `d`_{2}

:

`h`_{(n-1)} `d`_{(n-1)}

0 `d`_{n}

Superman starts at ground level and leaps `d`_{1}+...+`d`_{n}
metres, landing at ground level and clearing all of the buildings at
heights `h`_{2} to `h`_{(n-1)}, each with the given widths. `n` will be at most 100.

## Output:

Output is the angle and initial velocity that minimizes the height that
Superman attains, both appearing on the same line. The values should be
given to two decimal places and be accurate within 0.01 degrees or m/s,
as appropriate.

## Sample Input:

3
0 5
10 5
0 5
5
0 10.5
20 11.5
25 10
10 15
0 7

### Diagram for Second City-scape

(Not to scale.)
## Sample Output:

71.57 15.65
67.07 27.16