#include <bits/stdc++.h>
using namespace std;

int n; 
int x[6], y[6];
int d(int u, int v) {
    u %= n;
    v %= n;
    return abs(x[u] - x[v]) + abs(y[u] - y[v]);
}
int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> x[i] >> y[i];
    }
    cout.precision(15);
    vector<int> p;
    for (int i = 0; i < n; i++) {
        int a = (i + n - 1) % n;
        int b = i;
        int c = (i + 1) % n;

        if ((x[b] - x[a]) * (y[c] - y[b]) - (y[b] - y[a]) * (x[c] - x[b]) < 0) {
            p.push_back(i);
        }
    }
    if (p.size() == 0) {
        int H = 0, W = 0;
        for (int i = 0; i < n; i++) {
            H = max(H, abs(y[(i + 1) % n] - y[i]));
            W = max(W, abs(x[(i + 1) % n] - x[i]));
        }
        cout << fixed << (double)(H * W);
        return 0;
    }
    else {
        assert(p.size() == 1);
        int s = p[0];
        double ans = 0;
        double H2 = d(s, s + 1);
        double L1 = d(s + 1, s + 2);
        double H1 = d(s + 4, s + 5);
        double L2 = d(s + 5, s + 6);

        if (L1 * H1 > L2 * H2) {
            double T = sqrt((L1 * H1 - L2 * H2) * L1 / H1);
            ans += 2 * (L1 - T) * (L1 * L1 + L1 * T + T * T) * H1 * H1 / (3 * H2 * L1 * L1);
        }
        else {
            ans += 2 * L1 * H1 * H1 / (3 * H2);
        }
        swap(H2, L2);
        swap(H1, L1);
        if (L1 * H1 > L2 * H2) {
            double T = sqrt((L1 * H1 - L2 * H2) * L1 / H1);
            ans += 2 * (L1 - T) * (L1 * L1 + L1 * T + T * T) * H1 * H1 / (3 * H2 * L1 * L1);
        }
        else {
            ans += 2 * L1 * H1 * H1 / (3 * H2);
        }
        ans += H1 * L1;
        cout << fixed << ans;
    }
}