#include <bits/stdc++.h>
struct Coor {
  double x, y;
} p[301];
int sgn(double x) { return x < 1e-6 && x > -1e-6 ? 0 : x > 0 ? 1 : -1; }
double area_sgn(Coor a, Coor b, Coor c) {
  return a.x * b.y + b.x * c.y + c.x * a.y - b.x * a.y - c.x * b.y - a.x * c.y;
}
int dir(Coor a, Coor b, Coor c) { return sgn(area_sgn(a, b, c)); }
int main() {
  int i, j, k;
  int n;
  int p1, p2;
  double ans = 0;
  double max1, max2;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%lf%lf", &p[i].x, &p[i].y);
  }
  for (p1 = 0; p1 < n; p1++) {
    for (p2 = p1 + 1; p2 < n; p2++) {
      max1 = max2 = 0;
      for (k = 0; k < n; k++) {
        if (k == p1 || k == p2) continue;
        double area = area_sgn(p[k], p[p1], p[p2]);
        if (area > 0) {
          if (max1 < area) max1 = area;
        } else if (area < 0) {
          if (max2 < -area) max2 = -area;
        }
      }
      if (ans < max1 + max2 && max1 != 0 && max2 != 0) ans = max1 + max2;
    }
  }
  printf("%.10f\n", ans / 2.0);
}
