#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 50;
const double eps = 1e-10;
int gcd(int a, int b) { return a % b == 0 ? b : gcd(b, a % b); }
struct Point {
  double x, y;
  Point() {}
  Point(double x, double y) : x(x), y(y) {}
  Point operator-(Point B) { return Point(x - B.x, y - B.y); }
} p[500];
double Cross(Point A, Point B) { return A.x * B.y - A.y * B.x; }
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%lf %lf", &p[i].x, &p[i].y);
  double ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      double left = 0, right = 0;
      for (int k = 0; k < n; k++) {
        if (k == i || k == j) continue;
        double s = Cross(p[i] - p[k], p[j] - p[k]) * 0.5;
        if (s < eps)
          left = max(left, -s);
        else
          right = max(right, s);
      }
      if (left == 0 || right == 0) continue;
      ans = max(left + right, ans);
    }
  }
  printf("%lf\n", ans);
  return 0;
}
