#include <bits/stdc++.h>
using namespace std;
double xs[1005], ys[1005];
double dis(int i, int j) {
  return sqrt((xs[j] - xs[i]) * (xs[j] - xs[i]) +
              (ys[j] - ys[i]) * (ys[j] - ys[i]));
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lf%lf", &xs[i], &ys[i]);
  xs[0] = xs[n];
  ys[0] = ys[n];
  xs[n + 1] = xs[1];
  ys[n + 1] = ys[1];
  double ans = 1e12;
  for (int i = 1; i <= n; i++) {
    double x1 = xs[i - 1] - xs[i], y1 = ys[i - 1] - ys[i];
    double x2 = xs[i + 1] - xs[i], y2 = ys[i + 1] - ys[i];
    double chaji = (x1 * y2 - x2 * y1) / 2 / dis(i - 1, i + 1);
    ans = min(ans, chaji);
  }
  printf("%.7f\n", ans);
  return 0;
}
