#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

using namespace std;

using ll = long long;
using uint = unsigned;
using ull = unsigned long long;

int main() {
    int n;
    cin >> n;
    vector<int> X(n), Y(n);
    for (int i = 0; i < n; ++i) {
        cin >> X[i] >> Y[i];
    }
    vector<int> U(n-2);
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = i+1; j < n; ++j) {
            int cur = 0;
            for (int k = 0; k < n; ++k) {
                if(i == k || j == k) continue;
                U[cur++] = (X[k]-X[i])*(Y[j]-Y[i])-(Y[k]-Y[i])*(X[j]-X[i]);
            }
            ans = max(ans, *max_element(U.begin(),U.end())-*min_element(U.begin(),U.end()));
        }
    }
    cout << ans << "\n";
    return 0;
}