#include <bits/stdc++.h>
using namespace std;
const int maxn = 2010;
int n;
inline long double sqr(long double x) { return x * x; }
pair<long double, long double> operator-(
    const pair<long double, long double>& a,
    const pair<long double, long double>& b) {
  return pair<long double, long double>(a.first - b.first, a.second - b.second);
}
long double det(const pair<long double, long double>& a,
                const pair<long double, long double>& b) {
  return a.first * b.second - a.second * b.first;
}
long double dist(const pair<long double, long double>& a,
                 const pair<long double, long double>& b) {
  return sqrt(sqr(a.first - b.first) + sqr(a.second - b.second));
}
long double dis_point_segment(const pair<long double, long double>& p,
                              const pair<long double, long double>& s,
                              const pair<long double, long double>& t) {
  return fabs(det(s - p, t - p) / dist(s, t));
}
pair<long double, long double> a[maxn];
long double ans;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    a[i].first = x;
    a[i].second = y;
    a[n + i] = a[i];
  }
  ans = 1e20;
  for (int i = 3; i <= n + 3; ++i) {
    ans = min(ans, dis_point_segment(a[i], a[i - 1], a[i + 1]) / 2);
  }
  double Ans = ans;
  printf("%.10lf\n", Ans);
}
