#include <bits/stdc++.h>
using namespace std;
struct PT {
  int x, y;
  PT() {}
  PT(int x, int y) : x(x), y(y) {}
  PT operator+(const PT &p) const { return PT(x + p.x, y + p.y); }
  PT operator-(const PT &p) const { return PT(x - p.x, y - p.y); }
  int operator%(const PT &p) const { return x * p.y - y * p.x; }
};
PT arr[305];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = (0); i < (n); ++i) scanf("%d %d", &arr[i].x, &arr[i].y);
  int ans = 0;
  for (int i = (0); i < (n); ++i)
    for (int j = (i + 1); j < (n); ++j) {
      int left = 0, right = 0;
      bool ok1 = false, ok2 = false;
      for (int k = (0); k < (n); ++k) {
        if (k != i && k != j) {
          int area = (arr[k] - arr[i]) % (arr[j] - arr[i]);
          if (area < 0)
            left = max(left, -area), ok1 = true;
          else
            right = max(right, area), ok2 = true;
        }
      }
      if (ok1 && ok2) ans = max(ans, right + left);
    }
  printf("%lf\n", (double)ans / 2.0);
  return 0;
}
