#include <bits/stdc++.h>
using namespace std;
const int N = 200200;
const int mod = 1e9 + 7;
const long long INF = 1e18;
int n;
long long x[N];
long long y[N];
double get_dist(double xa, double ya, double xb, double yb) {
  return (xa - xb) * (xa - xb) + (ya - yb) * (ya - yb);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> x[i - 1] >> y[i - 1];
  double ans = 1e15;
  for (int i = 0; i < n; ++i) {
    int pre = (i - 1 + n) % n;
    int nxt = (i + 1) % n;
    double L = min(x[pre], x[nxt]), R = max(x[pre], x[nxt]);
    if (y[pre] == y[nxt]) {
      double dist = abs(y[i] - y[pre]);
      ans = min(ans, dist / 2.0);
      continue;
    }
    if (x[pre] == x[nxt]) {
      double dist = abs(x[i] - x[nxt]);
      ans = min(ans, dist / 2.0);
      continue;
    }
    double A = y[pre] - y[nxt];
    double B = x[nxt] - x[pre];
    double C = (x[pre] * y[nxt] - x[nxt] * y[pre]);
    double dist = (A * x[i] + B * y[i] + C) / sqrt(A * A + B * B);
    ans = min(ans, dist / 2.0);
  }
  cout.precision(15);
  cout << fixed << ans;
  return 0;
}
