#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
const int MAXK = 300;
const double INF = 1e18 + 10;
const double EPS = 1e-6;
int n;
long long x[MAXN], y[MAXN];
double dist(int l, int mid, int r) {
  long long mul =
      (x[mid] - x[l]) * (y[r] - y[l]) - (x[r] - x[l]) * (y[mid] - y[l]);
  return abs(mul) / sqrt(((y[r] - y[l]) * (y[r] - y[l])) +
                         ((x[r] - x[l]) * (x[r] - x[l])));
}
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> x[i] >> y[i];
  }
  double ans = INF;
  for (int i = 0; i < n; ++i) {
    ans = min(ans, dist(i, (i + 1) % n, (i + 2) % n));
  }
  printf("%.8f", ans / 2);
  return 0;
}
