#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f, INF = 0x3f3f3f3f;
const long long LLINF = 0x3f3f3f3f3f3f3f3f;
int read() {
  int s = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    s = (s << 3) + (s << 1) + ch - '0', ch = getchar();
  }
  return s * f;
}
const int mod = 1e9 + 7, MM = 1005;
int n, x[MM], y[MM];
double ans = 2e9;
void check(int i, int j, int k) {
  double x1 = x[j] - x[i], y1 = y[j] - y[i], x2 = x[k] - x[j], y2 = y[k] - y[j];
  double t = sqrt(x1 * x1 + y1 * y1);
  double d = abs(x1 * y2 - y1 * x2) / t;
  ans = min(ans, d / 2);
}
int main() {
  n = read();
  for (int i = 0; i < n; i++) x[i] = read(), y[i] = read();
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) {
      if (abs(i - j) <= 1 || (!i && j == n - 1) || (!j && i == n - 1)) continue;
      check(i, j, (i + 1) % n), check(i, j, (i - 1 + n) % n),
          check(i, j, (j + 1) % n), check(i, j, (j - 1 + n) % n);
    }
  printf("%.6f\n", ans);
}
