#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i, j;
  double x[1001], y[1001], d = 2000000000, m;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%lf", &x[i]);
    scanf("%lf", &y[i]);
  }
  for (i = 0; i < n - 2; i++) {
    m = abs(((y[i + 2] - y[i]) * (x[i + 1] - x[i]) +
             (x[i + 2] - x[i]) * (y[i] - y[i + 1])) /
            sqrt((y[i + 2] - y[i]) * (y[i + 2] - y[i]) +
                 (x[i + 2] - x[i]) * (x[i + 2] - x[i])));
    d = min(d, m / 2);
  }
  m = abs(((y[0] - y[n - 2]) * (x[n - 1] - x[n - 2]) +
           (x[0] - x[n - 2]) * (y[n - 2] - y[n - 1])) /
          sqrt((y[0] - y[n - 2]) * (y[0] - y[n - 2]) +
               (x[0] - x[n - 2]) * (x[0] - x[n - 2])));
  d = min(d, m / 2);
  m = abs(((y[1] - y[n - 1]) * (x[0] - x[n - 1]) +
           (x[1] - x[n - 1]) * (y[n - 1] - y[0])) /
          sqrt((y[1] - y[n - 1]) * (y[1] - y[n - 1]) +
               (x[1] - x[n - 1]) * (x[1] - x[n - 1])));
  d = min(d, m / 2);
  printf("%0.6lf\n", d);
  return 0;
}
