#include <bits/stdc++.h>
using namespace std;
double PI = acos(-1);
double EPS = 1e-6;
struct CPoint {
  double x, y;
  CPoint(double xx, double yy) : x(xx), y(yy) {}
  CPoint() {}
  void Read() { scanf("%lf%lf", &x, &y); }
};
struct CLine {
  CPoint a, b;
  CLine(CPoint aa, CPoint bb) : a(aa), b(bb) {}
  CLine() {}
  void Read() { scanf("%lf%lf%lf%lf", &a.x, &a.y, &b.x, &b.y); }
};
CPoint operator+(CPoint a, CPoint b) { return CPoint(a.x + b.x, a.y + b.y); }
CPoint operator-(CPoint a, CPoint b) { return CPoint(a.x - b.x, a.y - b.y); }
CPoint operator*(CPoint a, double k) { return CPoint(k * a.x, k * a.y); }
CPoint operator*(double k, CPoint a) { return CPoint(k * a.x, k * a.y); }
double operator*(CPoint a, CPoint b) { return a.x * b.x + a.y * b.y; }
double operator^(CPoint a, CPoint b) { return a.x * b.y - a.y * b.x; }
double cross(CPoint a, CPoint b) { return a.x * b.y - a.y * b.x; }
double Length(CPoint p) { return sqrt(p * p); }
CPoint unit(CPoint p) { return 1.0 / Length(p) * p; }
double project(CPoint p, CPoint n) { return p * (unit(n)); }
double area(CPoint a, CPoint b) { return a ^ b * 0.5; }
bool isZero(double x) { return -EPS < x && x < EPS; }
double dist(CPoint p, CPoint q) { return Length(p - q); }
double dist(CPoint p, CLine l) {
  return fabs((p - l.a) ^ (p - l.b)) / Length(l.a - l.b);
}
CPoint Rotate(CPoint a, CPoint b, double alpha) {
  CPoint p = b - a;
  return CPoint(a.x + (p.x * cos(alpha) - p.y * sin(alpha)),
                a.y + (p.x * sin(alpha) + p.y * cos(alpha)));
}
int sideOfLine(CPoint p, CLine l) {
  double res = (p - l.a) ^ (p - l.b);
  if (isZero(res)) {
    return 0;
  } else {
    return res > 0 ? 1 : -1;
  }
}
CLine Vertical(CPoint p, CLine l) {
  return CLine(p, p + (Rotate(l.b, l.a, PI / 2) - l.a));
}
CPoint root(CPoint p, CLine l) {
  return l.a + project(p - l.a, l.b - l.a) * unit(l.b - l.a);
}
double angle(CLine l, CLine m) {
  return acos(fabs(project(l.b - l.a, m.b - m.a) / Length(l.b - l.a)));
}
CPoint GetIntersect(CLine l, CLine m, string &s) {
  if (isZero(cross(l.b - l.a, m.b - m.a))) {
    if (!sideOfLine(l.a, m)) {
      s = "LINE";
    } else {
      s = "NONE";
    }
    return CPoint(0, 0);
  }
  s = "POINT";
  double t = cross(m.b - m.a, l.a - m.a) / cross(l.b - l.a, m.b - m.a);
  return l.a + (l.b - l.a) * t;
}
CPoint GetIntersect(CLine l, CLine m) {
  double t = cross(m.b - m.a, l.a - m.a) / cross(l.b - l.a, m.b - m.a);
  return l.a + (l.b - l.a) * t;
}
bool IsCross(CLine l, CLine m) {
  return sideOfLine(l.a, m) * sideOfLine(l.b, m) <= 0 &&
         sideOfLine(m.a, l) * sideOfLine(m.b, l) <= 0;
}
CPoint s[1005];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    s[i].Read();
  }
  double ans = 0x3f3f3f3f * 1.0;
  for (int i = 0; i < n; i++) {
    double l = dist(s[i], CLine(s[(i + 1) % n], s[(i + n - 1) % n]));
    ans = min(ans, l / 2);
  }
  printf("%.10f\n", ans);
  return 0;
}
