#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  double minm = DBL_MAX, curr, curr2;
  long long int x[n + 2], y[n + 2];
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
  }
  x[n] = x[0];
  y[n] = y[0];
  x[n + 1] = x[1];
  y[n + 1] = y[1];
  for (int i = 0; i < n; i++) {
    curr =
        abs(1.0 * sqrt(pow((x[i + 1] - x[i]), 2) + pow((y[i + 1] - y[i]), 2)));
    minm = minm < curr ? minm : curr;
  }
  for (int i = 0; i < n; i++) {
    curr =
        abs(1.0 * sqrt(pow((x[i + 2] - x[i]), 2) + pow((y[i + 2] - y[i]), 2)));
    curr2 = abs((x[i + 1] - x[i]) * (y[i + 2] - y[i]) -
                (y[i + 1] - y[i]) * (x[i + 2] - x[i]));
    curr = curr2 / curr;
    minm = minm < curr ? minm : curr;
  }
  minm = minm / 2.0;
  printf("%0.10f\n", minm);
  return 0;
}
