#include <bits/stdc++.h>
using namespace std;
struct Point {
  double x, y;
} z[301];
double cross(Point o, Point a, Point b) {
  return ((a.x - o.x) * (b.y - a.y) - (b.x - a.x) * (a.y - o.y)) / 2.0;
}
void maxc(double &a, double b) {
  if (b - a > 0.00000001) a = b;
}
int main() {
  int n;
  double t, maxArea = 0.0, positive = 0.0, negative = 0.0;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%lf %lf", &z[i].x, &z[i].y);
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++) {
      positive = -1.0;
      negative = -1.0;
      for (int k = 0; k < n; k++)
        if (i != k && j != k) {
          t = cross(z[i], z[j], z[k]);
          if (t < 0)
            maxc(negative, -t);
          else
            maxc(positive, t);
        }
      if (positive >= 0 && negative >= 0) maxc(maxArea, positive + negative);
    }
  printf("%lf", maxArea);
}
