#include <bits/stdc++.h>
using namespace std;
int n;
pair<int, int> a[1000];
double findarea(pair<int, int> a, pair<int, int> b, pair<int, int> c) {
  return ((double)a.first * (b.second - c.second) +
          (double)b.first * (c.second - a.second) +
          (double)c.first * (a.second - b.second)) /
         2.0;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d %d", &a[i].first, &a[i].second);
  double ans = 0;
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++) {
      double maxright = -1, maxleft = -1;
      for (int k = 0; k < n; k++) {
        if (k != i && k != j) {
          double area = findarea(a[i], a[j], a[k]);
          if (area < 0)
            maxleft = max(maxleft, -area);
          else
            maxright = max(maxright, area);
        }
      }
      if (maxright >= 0 && maxleft >= 0) ans = max(ans, maxleft + maxright);
    }
  printf("%.6lf\n", ans);
  return 0;
}
