#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
pair<long double, long double> P[N];
inline long double square(long double first) { return first * first; }
inline long double dis(const pair<long double, long double>& p,
                       const pair<long double, long double>& q) {
  return sqrt(square(p.first - q.first) + square(p.second - q.second));
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = (0), i_end = (n); i < i_end; ++i) {
    int first, second;
    scanf("%d%d", &first, &second);
    P[i] = pair<long double, long double>(first, second);
  }
  long double d = 1e10;
  for (int i = (0), i_end = (n); i < i_end; ++i) {
    int j = (i + 1) % n, k = (i + 2) % n;
    long double a = dis(P[i], P[j]), b = dis(P[j], P[k]), c = dis(P[k], P[i]),
                p = (a + b + c) / 2;
    d = min(d, sqrt(p * (p - a) * (p - b) * (p - c)) / c);
  }
  printf("%.8f\n", (double)d);
  return 0;
}
