You are given a convex polygon *P* with *n* distinct vertices *p*<sub class="lower-index">1</sub>, *p*<sub class="lower-index">2</sub>, ..., *p*<sub class="lower-index">*n*</sub>. Vertex *p*<sub class="lower-index">*i*</sub> has coordinates (*x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub>) 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 ≤ *n* ≤ 1 000) — the number of vertices.

The next *n* lines contain the coordinates of the vertices. Line *i* contains two integers *x*<sub class="lower-index">*i*</sub> and *y*<sub class="lower-index">*i*</sub> ( - 10<sup class="upper-index">9</sup> ≤ *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>) — 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).
Here is a picture of the first sample

<img class="tex-graphics" src="https://espresso.codeforces.com/f83aa076d2f437f9bb785cae769c3ae310eff351.png" style="max-width: 100.0%;max-height: 100.0%;"/>

Here is an example of making the polygon non-convex.

<img class="tex-graphics" src="https://espresso.codeforces.com/fbadb81630251ca642bd4ddf9088876ade761630.png" style="max-width: 100.0%;max-height: 100.0%;"/>

This is not an optimal solution, since the maximum distance we moved one point is  ≈ 0.4242640687, whereas we can make it non-convex by only moving each point a distance of at most  ≈ 0.3535533906.
4
0 0
0 1
1 1
1 0
0.3535533906
6
5 0
10 0
12 -4
10 -8
5 -8
3 -4
1.0000000000
19
449447997 711296339
530233434 692216537
535464528 613140435
535533467 100893188
530498867 -265063956
519107979 -271820709
482156929 -287792333
-303730271 -287970295
-416935204 -263348201
-443613873 -249980523
-453444829 -173903413
-462102798 -80789280
-462064673 -13220755
-461368561 482595837
-457749751 687048095
-448625206 709399396
-145117181 710688825
159099640 711650577
400454061 711503381
24967.1394973334
4
0 0
0 10
10 10
6 4
0.7071067812
4
-1000000000 -1000000000
-999999999 -999999999
1000000000 999999999
0 -1
0.0000000000
4
-1000000000 -1000000000
-1000000000 1000000000
1000000000 1000000000
1000000000 -1000000000
707106781.1865475000
4
-100000 -100000
-99999 -99999
100000 99999
0 -100
0.0000017678
4
-10000 -10000
-9999 -9999
10000 9999
0 -1000
0.0000176781
5
0 0
0 10
10 10
20 0
10 -1
0.5000000000
5
10 -1
0 0
0 10
10 10
20 0
0.5000000000
4
1000000000 1000000000
1000000000 -1000000000
-1000000000 -1000000000
-1000000000 1000000000
707106781.1865475000
4
2 0
0 0
0 14
8 14
0.8682431421
4
0 0
1 100
100 0
1 -100
0.5000000000
4
-1000000000 1000000000
1000000000 500000000
1000000000 -1000000000
-500000000 -1000000000
530330085.8899106400
from math import sqrt

n = int(input())
coor = []
for i in range(n):
    x,y = map(int, input().split())
    coor.append((x,y))
coor.append(coor[0])
coor.append(coor[1])

mini = None

for i in range(n):
    a2 = (coor[i][0]-coor[i+1][0])**2 + (coor[i][1]-coor[i+1][1])**2
    b2 = (coor[i+1][0]-coor[i+2][0])**2 + (coor[i+1][1]-coor[i+2][1])**2
    c2 = (coor[i+2][0]-coor[i][0])**2 + (coor[i+2][1]-coor[i][1])**2
    a,b,c = map(sqrt, [a2,b2,c2])
    s = (a+b+c)/2
    hc = 2*sqrt(s*(s-a)*(s-b)*(s-c))/c
    if mini is None or mini > hc:
        mini = hc
print(mini/2)
