#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 2e9;
const int MOD = 1e9 + 7;
const double EPS = 1e-5;
int N;
pair<long long, long long> arr[MAXN];
long double dist(pair<long long, long long> P, long long A, long long B,
                 long long C) {
  return (P.first * A + P.second * B + C) / sqrt((A) * (A) + (B) * (B));
}
int main() {
  scanf("%d ", &N);
  long double RES = 1e18;
  for (int i = 1; i <= N; i++)
    scanf("%lld %lld", &arr[i].first, &arr[i].second);
  for (int i = 1; i <= N; i++) {
    int j = i + 2, k = i + 1;
    if (j > N) j -= N;
    if (k > N) k -= N;
    long long A = (arr[i].second - arr[j].second);
    long long B = (arr[j].first - arr[i].first);
    long long C = (arr[i].first * arr[j].second - arr[i].second * arr[j].first);
    RES = min(RES, abs(dist(arr[k], A, B, C)));
  }
  cout.precision(7);
  cout << fixed << RES / 2;
  return 0;
}
