# Getting Away

Time Limit: 1 Second Memory Limit: 65536 KB

Pobi is a robot in a two-dimensional environment. Whenever Pobi is programmed with *n* two-dimensional vectors, he starts moving as follows:

at step *i*, he takes the* i ^{th} *vector

*v*and moves |

_{i}*v*| meters in the direction of either

_{i}*v*or

_{i}*-v*on his own decision where |

_{i}*v*| is the length of

_{i}*v*. Today, after getting programmed with nonzero vectors, Pobi has realized that he is standing on a massive bomb. To survive the bomb blast, Pobi is now trying to take the best decision at each step that leads him to the farthest possible point from the bomb. Your task is to compute how far he can get away from his initial position.

_{i}## Input

The input consists of several test cases. Each test case starts with a line containing the integer *n* (1 <= *n* <= 100). The vectors are specified in the next *n* lines. The *i ^{th}* line gives a pair of integers

*x*and

_{i}*y*specifying

_{i}*vi*= (

*x*,

_{i}*y*). The coordinates range from -1000 to 1000. The end of the input is specified by

_{i}*n*= 0.

## Output

For each test case, output on a separate line the maximum distance that Pobi can get away from his initial position. Output the answers rounded to 3 decimal places.

## Sample Input

3 1 1 1 0 -2 1 2 0 4 1 1 4 1 3 -3 -6 4 8 -2 -5 0

## Sample Output

4.000 5.099 24.166Submit

Source: 9th Iran Nationwide Internet Contest