#include <bits/stdc++.h>
using namespace std;
long long sq(long long x) { return x * x; }
long double ptos(pair<long long, long long> A, pair<long long, long long> B,
                 pair<long long, long long> C) {
  long long area = abs((B.first - A.first) * (C.second - A.second) -
                       (B.second - A.second) * (C.first - A.first));
  long long llen = sq(B.first - C.first) + sq(B.second - C.second);
  return 1.0l * area / sqrtl(llen);
}
int main() {
  int n;
  scanf("%d", &n);
  vector<pair<long long, long long> > p(n);
  for (int i = 0; i < n; ++i) {
    int first, second;
    scanf("%d %d", &first, &second);
    p[i].first = first, p[i].second = second;
  }
  p.push_back(p[0]);
  long double dans = 1e18l;
  for (int i = 0; i < n; ++i) {
    dans = min(dans, ptos(p[i], p[(i - 1 + n) % n], p[i + 1]));
    for (int j = 0; j < n; ++j) {
      if (i != j) {
        dans = min(dans, sqrtl(sq(p[i].first - p[j].first) +
                               sq(p[i].second - p[j].second)));
      }
      if (i != j && i != (j + 1) % n) {
        dans = min(dans, ptos(p[i], p[j], p[j + 1]));
      }
    }
  }
  printf("%.10lf\n", (double)(dans / 2));
  return 0;
}
