#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int n;
long double res;
long long x[N], y[N];
long double d(int i, int j) {
  return sqrtl(((x[i] - x[j]) * (x[i] - x[j])) +
               ((y[i] - y[j]) * (y[i] - y[j])));
}
long long ar(int i, int j, int k) {
  long long ret;
  ret = (x[j] - x[i]) * (y[k] - y[i]) - (x[k] - x[i]) * (y[j] - y[i]);
  if (ret < 0) ret *= -1;
  return ret;
}
void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
  for (int i = 0, j, k; i < n; i++) {
    j = i + 1;
    if (j >= n) j -= n;
    k = i + 2;
    if (k >= n) k -= n;
    if (i == 0)
      res = ar(i, j, k) / (d(i, k) * 2);
    else
      res = min(res, ar(i, j, k) / (d(i, k) * 2));
  }
  cout << fixed << setprecision(10) << res << "\n";
}
int main() {
  std::ios::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
