#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> a[111111];
int n;
inline void compute(int i, int j, double &d1, double &d2) {
  long long A1 = (a[(i + 1) % n].second - a[i].second);
  long long B1 = (a[i].first - a[(i + 1) % n].first);
  long long C1 =
      (a[(i + 1) % n].first * a[i].second - a[i].first * a[(i + 1) % n].second);
  d1 = abs((double)A1 * a[j].first + B1 * a[j].second + C1) /
       sqrt((double)A1 * A1 + B1 * B1);
  long long A2 = B1;
  long long B2 = -A1;
  long long C2 = -A2 * a[j].first - B2 * a[j].second;
  d2 = abs((double)A2 * a[i].first + B2 * a[i].second + C2) /
       sqrt((double)A2 * A2 + B2 * B2);
}
double ans = (double)1000000000 * 1000000000;
inline void solve() {
  int i = 0;
  int j = 1;
  long long s = a[j].first * a[i].second - a[i].first * a[j].second;
  do {
    while ((a[(i + 1) % n].first - a[i].first) *
                   (a[(j + 1) % n].first - a[j].first) +
               (a[(i + 1) % n].second - a[i].second) *
                   (a[(j + 1) % n].second - a[j].second) >=
           0) {
      s += (a[(j + 1) % n].first * a[j].second -
            a[j].first * a[(j + 1) % n].second);
      j = (j + 1) % n;
    }
    double d1, d2;
    compute(i, j, d1, d2);
    ans = min(ans, d1 * d2 / 2. - abs((s + (a[i].first * a[j].second -
                                            a[j].first * a[i].second)) /
                                      2.0));
    s -= (a[(i + 1) % n].first * a[i].second -
          a[i].first * a[(i + 1) % n].second);
    i = (i + 1) % n;
  } while (i);
}
int main() {
  scanf("%d", &n);
  for (int(i) = 0; (i) < (n); ++(i)) {
    int first, second;
    scanf("%d%d", &first, &second);
    a[i] = make_pair(first, second);
  }
  for (int(i) = 0; (i) < (n); ++(i)) {
    int j = (i + 1) % n;
    int k = (i + 2) % n;
    if ((a[i].first - a[j].first) * (a[k].first - a[j].first) +
            (a[i].second - a[j].second) * (a[k].second - a[j].second) >
        0) {
      cout << "0\n";
      return 0;
    }
  }
  solve();
  reverse(a + 1, a + n);
  solve();
  printf("%0.9f\n", ans);
}
