#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int iinf = 1 << 29;
const long long llinf = 1ll << 60;
const double PI = 3.14159265;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long mrand(long long B) { return (unsigned long long)rng() % B; }
long long cross(pair<long long, long long> p1, pair<long long, long long> p2) {
  return p1.first * p2.second - p2.first * p1.second;
}
bool online(pair<long long, long long> a, pair<long long, long long> b,
            pair<long long, long long> c) {
  pair<long long, long long> p1{b.first - a.first, b.second - a.second};
  pair<long long, long long> p2{c.first - a.first, c.second - a.second};
  return cross(p1, p2) == 0;
}
void z_func(vector<int> &z, vector<int> &s, int n) {
  int L = 0, R = 0;
  for (int i = 1; i < n; i++) {
    if (i > R) {
      L = R = i;
      while (R < n && s[R - L] == s[R]) R++;
      z[i] = R - L;
      R--;
    } else {
      int k = i - L;
      if (z[k] < R - i + 1)
        z[i] = z[k];
      else {
        L = i;
        while (R < n && s[R - L] == s[R]) R++;
        z[i] = R - L;
        R--;
      }
    }
  }
}
void work() {
  int n;
  cin >> n;
  vector<pair<long long, long long>> v(n);
  for (auto &e : v) cin >> e.first >> e.second;
  long double d = llinf;
  for (int i = 0; i < n; i++) {
    auto &a = v[i];
    auto &b = i == 0 ? v[n - 1] : v[i - 1];
    auto &c = i == n - 1 ? v[0] : v[i + 1];
    d = min(d,
            abs((long double)cross({b.first - c.first, b.second - c.second},
                                   {a.first - c.first, a.second - c.second})) /
                (2.0 * (long double)sqrt(
                           (b.first - c.first) * (b.first - c.first) +
                           (b.second - c.second) * (b.second - c.second))));
  }
  cout << setprecision(17) << d << endl;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  work();
  return 0;
}
