Bob has a convex polygon with $$$N$$$ vertices, and he wants to cut it into $$$N - 2$$$ triangles using exactly $$$N - 3$$$ straight line segments, with each starts and ends at two distinct vertices of the polygon. Notice that there must not be two segments intersecting each other, but they can share the same end point.
Bob knows that simply cutting the polygon is an easy job, therefore while cutting it he also wants the triangles look beautiful. Ideally, the triangles are the most beautiful if all of their areas are the same, i.e. the variance of the areas is $$$0$$$, but Bob knows that it may not be possible. Instead of only seeking for the ideal cutting, he wants to know the minimum variance of areas of the triangles if he cut the polygon optimally, so that they are as beautiful as possible.
Bob asks you for help since he is busy stacking papers from problem K. Please calculate the minimum possible variance of areas of the triangles.
While Bob is stacking the papers, he also reminds you that variance equals the following formula:
$$$$$$ \frac{\displaystyle\sum_{i=1}^{n}(x_i - \mu)^2} {n} $$$$$$
where $$$\mu$$$ is the mean of all $$$n$$$ numbers $$$x_1$$$, $$$x_2$$$, ..., $$$x_n$$$.
The first line contains one integer $$$N$$$ ($$$3\le N \le 100$$$), the number of vertices of the polygon.
The following $$$N$$$ lines each contains two integers $$$x$$$ and $$$y$$$ ($$$-1000 \le x, y \le 1000$$$), representing the x-coordinate and y-coordinate of a vertex. It is guaranteed that the vertices form a convex polygon, and they are given in anti-clockwise order.
Output one number, the minimum possible variance of areas of the triangles. Your answer is considered correct if its absolute or relative error does not exceed $$$ 10^{-6} $$$. Formally, let your answer be $$$x$$$ and let the correct answer be $$$y$$$. Your answer is accepted if and only if $$$\frac{ \mid x-y \mid }{ max(1, \mid y \mid) } \le 10^{-6} $$$.
4 0 0 4 0 4 1 2 2
0.2500000000
4 0 0 4 0 4 2 2 3
0.0000000000
| Name |
|---|


