#include <bits/stdc++.h>
using namespace std;
typedef struct {
  int x, y;
} point;
double absf(double a) { return (a < 0 ? -a : a); }
int main() {
  int n;
  cin >> n;
  point a[n];
  for (int i = 0; i < n; ++i) cin >> a[i].x >> a[i].y;
  double s = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (i == j) continue;
      double mn = 1e9, mx = -1e9, p = 0;
      int mn_id = 0, mx_id = 0;
      for (int k = 0; k < n; ++k) {
        if (k == i || k == j) continue;
        p = (a[i].x - a[k].x) * (a[j].y - a[k].y) -
            (a[i].y - a[k].y) * (a[j].x - a[k].x);
        if (mn > p) {
          mn = p;
          mn_id = k;
        }
        if (mx < p) {
          mx = p;
          mx_id = k;
        }
      }
      if (mn_id != mx_id) s = max(s, absf(mx - mn));
    }
  }
  s /= 2;
  cout.precision(20);
  cout << s;
  return 0;
}
