#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 10;
struct pos {
  double x, y;
} p[maxn];
int n;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%lf%lf", &p[i].x, &p[i].y);
  double ans = 0x3f3f3f3f;
  for (int i = 0; i < n; i++) {
    pos a = p[i];
    pos b = p[(i + 1) % n];
    pos c = p[(i + 2) % n];
    double dis = (double)(c.x - a.x) * (b.y - c.y) - (c.y - a.y) * (b.x - c.x);
    if (dis < 0) dis = -dis;
    dis = dis / (sqrt((c.x - a.x) * (c.x - a.x) + (c.y - a.y) * (c.y - a.y)));
    dis = dis / 2;
    ans = min(ans, dis);
  }
  printf("%f", ans);
}
