#include <bits/stdc++.h>
using namespace std;
struct node {
  int x, y;
} op[310];
int cal(node a, node b, node c) {
  return (b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y);
}
int main() {
  int n, i, j, k, ans, maxn, minn, tmp;
  scanf("%d", &n);
  for (i = 0; i < n; i++) scanf("%d%d", &op[i].x, &op[i].y);
  ans = 0;
  for (i = 0; i < n; i++)
    for (j = i + 1; j < n; j++) {
      maxn = minn = 0;
      for (k = 0; k < n; k++) {
        tmp = cal(op[i], op[j], op[k]);
        maxn = max(maxn, tmp);
        minn = min(minn, tmp);
      }
      if (maxn != 0 && minn != 0) ans = max(ans, maxn - minn);
    }
  printf("%.9lf", (double)ans / 2);
  return 0;
}
