#include <bits/stdc++.h>
using namespace std;
struct pt {
  double x, y;
};
bool cmp(pt a, pt b) { return (a.x < b.x) || (a.x == b.x && a.y < b.y); }
double dist(pt a, pt b, pt c) {
  return fabs(c.x * (b.y - a.y) - c.y * (b.x - a.x) + b.x * a.y - b.y * a.x) /
         sqrt((b.y - a.y) * (b.y - a.y) + (b.x - a.x) * (b.x - a.x));
}
int n;
pt p[1100];
double ans = 1e18, d;
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> p[i].x >> p[i].y;
  for (int i = 0; i < n; ++i) {
    d = dist(p[i], p[(i + 2) % n], p[(i + 1) % n]);
    if (ans > d) ans = d;
  }
  printf("%.10f", ans / 2);
  return 0;
}
