Polygon#3018
Write a program to find a convex polygon whose sides have the given lengths.
In this problem, a polygon is considered convex if all its inner angles are strictly greater than degrees and strictly less than degrees.
The first line contains the integer , the number of vertices of the polygon (3 \leq N \leq 1000). Each of the next lines contains an integer a_i, the length of one side of the polygon (1 \leq a_i \leq 10000).
If such a polygon can be constructed, the output should contain exactly lines. Each line must contain two real numbers x_i and y_i (|x_i| \leq 10000000, |y_i| \leq 10000000), such that connecting the points (x_i, y_i) and (x_{i+1}, y_{i+1}) for all 1 \leq i \lt N and (x_N, y_N) with (x_1, y_1) forms a convex polygon. The lengths of the line segments must equal the numbers given in the input (not necessarily in the same order).
The vertices of the polygon can be listed in either clockwise or counterclockwise order.
If the polygon cannot be constructed, output NO SOLUTION on a single line.
Example 1