#include <bits/stdc++.h>
using namespace std;
struct node {
  double x, y;
} a[310];
double f(int i, int j, int k) {
  return (a[k].x * (a[i].y - a[j].y) + a[j].x * (a[k].y - a[i].y) +
          a[i].x * (a[j].y - a[k].y)) /
         2.0;
}
int main() {
  int n, i, j, k;
  double smax = -10000000000, xmax = -10000000000, ans = -10000000000, temp;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i].x >> a[i].y;
  }
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) {
      if (j == i) continue;
      smax = -10000000000;
      xmax = -10000000000;
      for (k = 1; k <= n; k++) {
        if (k == i || k == j) continue;
        temp = f(i, j, k);
        if (temp < 0) {
          smax = max(smax, -temp);
        } else {
          xmax = max(xmax, temp);
        }
      }
      ans = max(ans, smax + xmax);
    }
  }
  printf("%.6lf", ans);
  return 0;
}
