#include <bits/stdc++.h>
using namespace std;
const double INF = 1000000000;
struct node {
  double x, y;
};
node p[350];
double mul(int i, int j, int k) {
  return ((p[k].x - p[i].x) * (p[k].y - p[j].y) -
          (p[k].y - p[i].y) * (p[k].x - p[j].x)) /
         2.0;
}
int main() {
  int n, i, j, k;
  while (scanf("%d", &n) != EOF) {
    for (i = 0; i < n; i++) {
      scanf("%lf%lf", &p[i].x, &p[i].y);
    }
    double lmax = -INF, rmax = -INF, amax = -INF;
    for (i = 0; i < n; i++) {
      for (j = 0; j < n; j++) {
        if (i == j) continue;
        lmax = -INF, rmax = -INF;
        for (k = 0; k < n; k++) {
          if (i == k || j == k) continue;
          double temp = mul(i, j, k);
          if (temp < 0) {
            lmax = max(lmax, -temp);
          } else {
            rmax = max(rmax, temp);
          }
        }
        amax = max(amax, lmax + rmax);
      }
    }
    printf("%.6f\n", amax);
  }
  return 0;
}
