B"You are given a convex polygon P with n distinct vertices p1, xe2 x80 x89p2, xe2 x80 x89..., xe2 x80 x89pn. Vertex pi has coordinates (xi, xe2 x80 x89yi) in the 2D plane. These vertices are listed in clockwise order. You can choose a real number D and move each vertex of the polygon a distance of at most D from their original positions. Find the maximum value of D such that no matter how you move the vertices, the polygon does not intersect itself and stays convex. The first line has one integer n (4 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891 xe2 x80 x89000) -- the number of vertices. The next n lines contain the coordinates of the vertices. Line i contains two integers xi and yi ( xe2 x80 x89- xe2 x80 x89109 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89xi, xe2 x80 x89yi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) -- the coordinates of the i-th vertex. These points are guaranteed to be given in clockwise order, and will form a strictly convex polygon (in particular, no three consecutive points lie on the same straight line). Print one real number D, which is the maximum real number such that no matter how you move the vertices, the polygon stays convex. Your answer will be considered correct if its absolute or relative error does not exceed 10 xe2 x80 x89- xe2 x80 x896. Namely, let's assume that your answer is a and the answer of the jury is b. The checker program will consider your answer correct if . Here is a picture of the first sample Here is an example of making the polygon non-convex. This is not an optimal solution, since the maximum distance we moved one point is xe2 x80 x89 xe2 x89 x88 xe2 x80 x890.4242640687, whereas we can make it non-convex by only moving each point a distance of at most xe2 x80 x89 xe2 x89 x88 xe2 x80 x890.3535533906. "...