Kids Like Cakes#2380
Kids like cakes. It's obvious. In this problem, we consider only cakes in the form of a convex polygon, as seen from above.
Every cake needs to be split into pieces. In this problem, each piece should be a non-degenerate triangle whose vertices are among the original cake's vertices. Pieces may not intersect, and their union must form the original cake.
Some kids also like fairness. We define the cake's unfairness number as the maximum possible difference between the areas of its largest and smallest pieces.
The first line contains a single integer (4 \le n \le 5000) — the number of vertices of the cake. The following lines each contain two integers x_i, y_i (-10^8 \le x_i, y_i \le 10^8) — the coordinates of the vertices.
The first line must contain the unfairness number of the cake, with exactly one digit after the decimal point.
The following two lines must describe the way to split the cake to achieve this unfairness number. The first of them should contain three indices of the vertices of the largest piece. The second should contain three indices of the vertices of the smallest piece. Vertices are numbered from to .
Example 1