#include <bits/stdc++.h>
using namespace std;
int n;
long double x[1010], y[1010];
long double ans = -1;
int main() {
  cin >> n;
  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) {
    long double A = y[i + 2] - y[i];
    long double B = x[i] - x[i + 2];
    long double C = -A * x[i] - B * y[i];
    long double d =
        1. * abs(A * x[i + 1] + B * y[i + 1] + C) / sqrt(1. * A * A + B * B);
    if (ans == -1 || d < ans) ans = d;
  }
  cout << fixed;
  cout.precision(10);
  cout << ans / 2. << endl;
  return 0;
}
