#include <bits/stdc++.h>
using namespace std;
long long n, x[1010], y[1010];
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];
  double res = 1e12;
  for (int i = 1; i <= n; i++) {
    double v =
        fabs((y[i + 1] - y[i - 1]) * x[i] - (x[i + 1] - x[i - 1]) * y[i] +
             x[i + 1] * y[i - 1] - y[i + 1] * x[i - 1]) /
        sqrt(pow(y[i + 1] - y[i - 1], 2) + pow(x[i + 1] - x[i - 1], 2));
    res = min(res, v / 2);
  }
  cout.precision(20);
  cout << res << "\n";
  return 0;
}
