#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7, N = 1007;
int n;
double x[N], y[N], prev_x, prev_y, cur_x, cur_y, next_x, next_y, alpha, beta,
    dist, ans = 1e18;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> x[i] >> y[i];
  }
  x[0] = x[n];
  y[0] = y[n];
  x[n + 1] = x[1];
  y[n + 1] = y[1];
  for (int i = 1; i <= n; i++) {
    prev_x = x[i - 1];
    prev_y = y[i - 1];
    cur_x = x[i];
    cur_y = y[i];
    next_x = x[i + 1];
    next_y = y[i + 1];
    alpha = next_y - prev_y;
    beta = next_x - prev_x;
    dist = abs(alpha * (cur_x - prev_x) + beta * (prev_y - cur_y)) /
           sqrt(alpha * alpha + beta * beta);
    ans = min(ans, dist);
  }
  ans /= 2;
  printf("%.7f", ans);
  return 0;
}
