#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const double INF = 1e18;
struct Point {
  double x, y;
  Point() {}
  Point(double _x, double _y) { x = _x, y = _y; }
  void input() { scanf("%lf%lf", &x, &y); }
  double distant(Point p) { return hypot(x - p.x, y - p.y); }
  double operator^(const Point &b) { return x * b.y - y * b.x; }
  Point operator-(const Point &b) const { return Point(x - b.x, y - b.y); }
};
Point p[maxn];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) p[i].input();
  double ans = INF;
  for (int i = 0; i < n; i++) {
    double area =
        fabs((p[i] - p[(i + 1) % n]) ^ (p[(i + 2) % n] - p[(i + 1) % n])) / 2.0;
    double d = p[i].distant(p[(i + 2) % n]);
    ans = min(ans, area / d);
  }
  printf("%.6f\n", ans);
  return 0;
}
