#include <bits/stdc++.h>
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)

using namespace std;

int main() {
  int N;
  cin >> N;
  vector<int> X(N), Y(N);
  REP(i, N) cin >> X[i] >> Y[i];
  int ans = 0;
  REP(i, N) FOR(j, i + 1, N) {
    int l = 0, r = 0;
    REP(k, N) {
      l = max(l, (X[k] - X[j]) * (Y[i] - Y[j]) - (Y[k] - Y[j]) * (X[i] - X[j]));
      r = max(r, (X[k] - X[i]) * (Y[j] - Y[i]) - (Y[k] - Y[i]) * (X[j] - X[i]));
    }
    if (l > 0 && r > 0) ans = max(ans, l + r);
  }
  cout << ans << endl;
  return 0;
}