#include <bits/stdc++.h>
using namespace std;
const int MAXN = 500000;
long long x[MAXN], y[MAXN];
int main() {
  int(n);
  scanf("%d", &n);
  for (int i = 0; i < (n); ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    x[i] = a, y[i] = b;
  }
  double ans = 1e19;
  for (int i = 0; i < (n); ++i) {
    long long px = x[(i + n - 1) % n], py = y[(i + n - 1) % n];
    long long nx = x[(i + 1) % n], ny = y[(i + 1) % n];
    long long ax = x[i] - px, ay = y[i] - py;
    long long bx = nx - px, by = ny - py;
    double area = bx * ay - by * ax;
    double dis = area / sqrt(bx * bx + by * by);
    ans = min(ans, dis);
  }
  printf("%.11lf", ans / 2);
}
