#include <bits/stdc++.h>
using namespace std;
int n;
long long x[1000], y[1000];
long long calculated[1000][1000];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
  }
  double ans = DBL_MAX;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (i == j) continue;
      calculated[i][j] =
          (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
      ans = min(ans, sqrt(calculated[i][j]));
    }
  }
  for (int i = 0; i < n; i++) {
    int j = (i + 1) % n;
    for (int k = 0; k < n; k++) {
      if (k == i || k == j) continue;
      double A =
          abs(((x[j] - x[i]) * (y[k] - y[i]) - (x[k] - x[i]) * (y[j] - y[i])) /
              2.0);
      long long best =
          max(max(calculated[i][j], calculated[j][k]), calculated[k][i]);
      ans = min(ans, A / sqrt(best));
    }
  }
  printf("%.10lf\n", ans);
  return 0;
}
