#include <bits/stdc++.h>
using namespace std;
long double x[1002], y[1002];
int n;
long double dist(long double x1, long double y1, long double x2,
                 long double y2) {
  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
int main() {
  cout.setf(ios::fixed);
  cout.precision(6);
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> x[i] >> y[i];
  long double ans = 1000000002;
  for (int i = 0; i < n; ++i)
    ans = min(ans, (dist(x[i], y[i], x[(i + 1) % n], y[(i + 1) % n])) / 2);
  for (int i = 0; i < n; ++i) {
    int k = (i - 1 + n) % n;
    int l = (i + 1) % n;
    long double d = abs((y[l] - y[k]) * x[i] - (x[l] - x[k]) * y[i] +
                        x[l] * y[k] - y[l] * x[k]);
    d /= dist(x[k], y[k], x[l], y[l]);
    ans = min(ans, d / 2);
  }
  cout << ans << endl;
  return 0;
}
