#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1005;
int n;
double a[MAXN], b[MAXN];
double dist(double A, double B, double C, int c) {
  double up = fabs(A * a[c] + B * b[c] + C);
  double down = sqrt(A * A + B * B);
  return up / down / 2;
}
double solve(int p1, int p2, int c) {
  double A = b[p1] - b[p2];
  double B = a[p2] - a[p1];
  double C = b[p1] * (a[p1] - a[p2]) - (b[p1] - b[p2]) * a[p1];
  return dist(A, B, C, c);
}
int main() {
  while (scanf("%d", &n) != EOF) {
    for (int i = 0; i < n; i++) scanf("%lf%lf", &a[i], &b[i]);
    double ans = 1e15;
    for (int i = 0; i < n; i++) {
      if (i == 0) {
        ans = min(ans, solve(n - 1, 1, i));
      } else if (i == n - 1) {
        ans = min(ans, solve(n - 2, 0, i));
      } else
        ans = min(ans, solve(i - 1, i + 1, i));
    }
    printf("%.10lf\n", ans);
  }
  return 0;
}
