#include<bits/stdc++.h>
using namespace std;

// x2
int triangle_area(int x1, int y1, int x2, int y2, int x3, int y3){
    return abs((x1 - x3) * (y2 - y3) - (x2 - x3) * (y1 - y3));
}

int main(){
    int n; cin >> n;
    vector<int> x(n), y(n);
    for(int i = 0; i < n; i++){
        cin >> x[i] >> y[i];
    }
    int ans = 0;
    for(int i = 0; i < n; i++){
        for(int j = i + 1; j < n; j++){
            int a = (y[j] - y[i]), b = (x[i] - x[j]), c = (y[i] - y[j]) * x[i] + (x[j] - x[i]) * y[i];
            int mx1 = -1, mx2 = -1;
            int idx1 = -1, idx2 = -1;
            for(int k = 0; k < n; k++){
                if(k == i || k == j) continue;
                int len = a * x[k] + b * y[k] + c;
                if(len > 0){
                    if(mx1 < abs(len)){
                        mx1 = abs(len), idx1 = k;
                    }
                }else{
                    if(mx2 < abs(len)){
                        mx2 = abs(len), idx2 = k;
                    }
                }
            }
            if(mx1 == -1 || mx2 == -1) continue;
            int res = triangle_area(x[i], y[i], x[j], y[j], x[idx1], y[idx1]) + triangle_area(x[i], y[i], x[j], y[j], x[idx2], y[idx2]);
            ans = max(ans, res);
        }
    }
    cout << ans << "\n";
}