#include <bits/stdc++.h>
using namespace std;
int dx[] = {+1, -1, 0, 0};
int dy[] = {0, 0, +1, -1};
int dx2[] = {+1, -1, 0, 0, +1, +1, -1, -1};
int dy2[] = {0, 0, +1, -1, +1, -1, -1, +1};
inline long long squ(long long x) { return (x * x); }
inline long long power(long long bs, long long k) {
  long long x = 1LL, y = bs;
  if (k == 0) return 1LL;
  while (k > 0) {
    if (k % 2) x *= y;
    y *= y;
    k /= 2;
  }
  return x;
}
bool df(long long i, long long j, long long k) {
  if (i != j && i != k && j != k) return true;
  return false;
}
struct points {
  long long x, y;
} p[100100];
double calc(long long i, long long j, long long k) {
  double ans =
      fabs((double)(((p[k].y - p[i].y) * p[j].x) -
                    ((p[k].x - p[i].x) * p[j].y) + (p[k].x * p[i].y) -
                    (p[i].x * p[k].y))) /
      sqrt((double)squ(p[i].y - p[k].y) + (double)squ(p[i].x - p[k].x));
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cout.unsetf(ios::floatfield);
  cout.precision(10);
  cout.setf(ios::fixed, ios::floatfield);
  ;
  long long n, i, j, k;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> p[i].x >> p[i].y;
  }
  double ans = 1000000000000000000.000;
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) {
      if (i != j && (i + 1) % n != j) {
        ans = min(ans, calc(i, (i + 1) % n, j));
        ans = min(ans, calc(i, j, (i + 1) % n));
        ans = min(ans, calc((i + 1) % n, j, i));
      }
    }
  }
  cout << ans / 2.00;
  return 0;
}
