Problem:
Score: 600 points

Problem Statement

E869120 is initially standing at the origin (0, 0) in a two-dimensional plane.

He has N engines, which can be used as follows:

When E869120 uses the i-th engine, his X- and Y-coordinate change by x_i and y_i, respectively. In other words, if E869120 uses the i-th engine from coordinates (X, Y), he will move to the coordinates (X + x_i, Y + y_i).

E869120 can use these engines in any order, but each engine can be used at most once. He may also choose not to use some of the engines.

He wants to go as far as possible from the origin.
Let (X, Y) be his final coordinates. Find the maximum possible value of \sqrt{X^2 + Y^2}, the distance from the origin.

Constraints

1 \leq N \leq 100

-1 \ 000 \ 000 \leq x_i \leq 1 \ 000 \ 000

-1 \ 000 \ 000 \leq y_i \leq 1 \ 000 \ 000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
x_1 y_1
x_2 y_2
: :
x_N y_N

Output

Print the maximum possible final distance from the origin, as a real value.
Your output is considered correct when the relative or absolute error from the true answer is at most 10^{-10}.

Sample Input 1

3
0 10
5 -5
-5 -5

Sample Output 1

10.000000000000000000000000000000000000000000000000

The final distance from the origin can be 10 if we use the engines in one of the following three ways:

Use Engine 1 to move to (0, 10).

Use Engine 2 to move to (5, -5), and then use Engine 3 to move to (0, -10).

Use Engine 3 to move to (-5, -5), and then use Engine 2 to move to (0, -10).

The distance cannot be greater than 10, so the maximum possible distance is 10.

Sample Input 2

5
1 1
1 0
0 1
-1 0
0 -1

Sample Output 2

2.828427124746190097603377448419396157139343750753

The maximum possible final distance is 2 \sqrt{2} = 2.82842....
One of the ways to achieve it is:

Use Engine 1 to move to (1, 1), and then use Engine 2 to move to (2, 1), and finally use Engine 3 to move to (2, 2).

Sample Input 3

5
1 1
2 2
3 3
4 4
5 5

Sample Output 3

21.213203435596425732025330863145471178545078130654

If we use all the engines in the order 1 \rightarrow 2 \rightarrow 3 \rightarrow 4 \rightarrow 5, we will end up at (15, 15), with the distance 15 \sqrt{2} = 21.2132... from the origin.

Sample Input 4

3
0 0
0 1
1 0

Sample Output 4

1.414213562373095048801688724209698078569671875376

There can be useless engines with (x_i, y_i) = (0, 0).

Sample Input 5

1
90447 91000

Sample Output 5

128303.000000000000000000000000000000000000000000000000

Note that there can be only one engine.

Sample Input 6

2
96000 -72000
-72000 54000

Sample Output 6

120000.000000000000000000000000000000000000000000000000

There can be only two engines, too.

Sample Input 7

10
1 2
3 4
5 6
7 8
9 10
11 12
13 14
15 16
17 18
19 20

Sample Output 7

148.660687473185055226120082139313966514489855137208

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996) 
 
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;


int main(int argc, char* argv[])
{
    int n;
    scanf("%d", &n);

    const long double PI=3.141592653589793238462643;
    vector<pair<long double, pair<int,int> > > z(n);
    int i;
    for(i=0; i<n; i++) {
        int x,y;
        scanf("%d%d", &x, &y);
        long double t=0;
        if(x!=0 || y!=0) {
            t=atan2((long double)y,(long double)x)+PI;
        }
        z[i]=make_pair(t, make_pair(x,y));
    }
    sort(z.begin(), z.end());

    vector<long double> sx(n+1,0), sy(n+1,0);
    for(i=0; i<n; i++) {
        sx[i+1]=sx[i]+z[i].second.first;
        sy[i+1]=sy[i]+z[i].second.second;
    }

    long double ans=0;
    for(i=0; i<n; i++) {
        long double t = z[i].first;
        long double sumx=0, sumy=0;
        if(t<=2*PI) {
            int k = lower_bound(z.begin(), z.end(), make_pair(t+PI, make_pair(0,0))) - z.begin();
            sumx=sx[k]-sx[i];
            sumy=sy[k]-sy[i];
            //printf("%lf %lf\n", sumx,sumy);
        }
        else {
            sumx=sx[n]-sx[i];
            sumy=sy[n]-sy[i];
            int k = lower_bound(z.begin(), z.end(), make_pair(t-PI, make_pair(0,0))) - z.begin();
            sumx+=sx[k];
            sumy+=sy[k];
            //printf("%lf %lf\n", sumx,sumy);
        }
        long double ans0=sumx*sumx+sumy*sumy;
        ans=MAX(ans,ans0);
    }

    int NN=10000;
    for(i=0; i<NN; i++) {
        long double t = PI/NN*i;
        long double sumx=0, sumy=0;
        
        int k = lower_bound(z.begin(), z.end(), make_pair(t, make_pair(0,0))) - z.begin();
        int m = lower_bound(z.begin(), z.end(), make_pair(t+PI, make_pair(0,0))) - z.begin();
        sumx=sx[m]-sx[k];
        sumy=sy[m]-sy[k];
        //printf("%lf %lf\n", sumx,sumy);

        long double ans0=sumx*sumx+sumy*sumy;
        ans=MAX(ans,ans0);
    }
    printf("%.16Lf\n", sqrt(ans));

    return 0;
}