#include <bits/stdc++.h>
using namespace std;
int N;
complex<double> p[300];
void read();
void solve();
inline double cross(complex<double> u, complex<double> v) {
  return imag(conj(u) * v);
}
int main() {
  read();
  solve();
  return 0;
}
void read() {
  double x, y;
  cin >> N;
  for (int i = 0; i < N; ++i) cin >> x >> y, p[i] = complex<double>(x, y);
}
void solve() {
  double res = 0.0;
  for (int i = 0; i < N; ++i)
    for (int j = i + 1; j < N; ++j) {
      double mx = 0.0, mn = 0.0;
      for (int k = 0; k < N; ++k)
        if (k != i && k != j) {
          mx = max(mx, cross(p[j] - p[i], p[k] - p[i]));
          mn = min(mn, cross(p[j] - p[i], p[k] - p[i]));
        }
      if (mx != 0.0 && mn != 0.0) res = max(res, mx + abs(mn));
    }
  cout.setf(ios::fixed), cout.precision(10);
  cout << (0.5 * res) << "\n";
}
