You are about to plant a pair of fine kiwi trees inside your
big property. You are worried that tree branches would grow
beyond the boundaries of your property, making your neighbours
complain. You must also avoid planting the two trees too close
to each other so that the branches of the trees grow into each
other, because that could lead to a loss of fruit.
The seller of the trees guaranteed that no branch or leaf
will be farther than $4$ meters from the trunk of its
tree, thus we will model the trees as circles of radius
$4$ meters. The
trunks are perfectly vertical.
Local government regulations forbid certain shapes of
properties. In particular, in order for government employees to
be able to draw and handle maps of the area, each property must
satisfy the following properties:

The boundary is a simple polygon, i.e. the sides are
nonintersecting and form a closed path.

Each side length of the property is at least
$30$ meters long.

The angle between any two consecutive sides of the
property must be at least $18$ degrees ($10\% $ of a straight angle), and
at most $144$ degrees
($80\% $ of a straight
angle, or if you will, the angle of a regular decagon).
Nonconvex properties are allowed as long as the angles of
consecutive sides follow rule 3 above, so the inner angle at a
vertex can also be between $360 
144 = 216$ and $360  18 =
342$ degrees. See Figure 1 for an example.
Your property follows these rules. Can you plant two trees
inside the property such that their branches and leaves do not
grow beyond its boundary, and that the branches and leaves of
each tree do not grow into the other tree?
Input
The input consists of:

One line containing an integer $n$, where $3 \le n \le 2\, 000$ is the
number of vertices of the polygon describing your
property.

$n$ lines
describing one vertex each. Each such line contains two
integers $x$ and
$y$, where
$0 \le x, y \le 10^7$.
These two numbers denote the $x$ and $y$coordinates of a vertex in
millimeters, in a clockwise order as they appear
in the polygon.
Also, each polygon side is at least $30$ meters ($30\, 000$ millimeters) long and the
angle of two segments at a vertex is at least $18$ degrees and at most $144$ degrees. The polygon is
nonintersecting and closed, i.e. the last vertex is
connected to the first vertex.
Output
If it is possible to plant two trees without their branches
growing beyond the boundary of your property or into each
other, output two lines, each containing two real numbers
$x$ and $y$ giving the coordinates in
millimeters of two points where the trees can be planted.
Otherwise, print “impossible”.
You may assume that increasing or decreasing the radius by
$1$ mm will not change
whether or not it is possible to plant the trees. Your answer
will be accepted if the tree locations are at least
$3999$ mm away from the
boundary and at least $2 \cdot
3999$ mm away from each other.
Sample Input 1 
Sample Output 1 
4
0 3000
29000 38000
56000 0
28000 14000

32266.13633130 18219.22050526
24266.13633130 18219.22050526

Sample Input 2 
Sample Output 2 
3
50000 50000
69500 73000
99000 80000

impossible
