/* author: kyawa */
#include<bits/stdc++.h>
using namespace std;

/*
 考察
 二点固定
 残りを高さ順にソート
 */

int main(){
    int64_t res = 0;
    int64_t N; cin >> N;
    vector<pair<int64_t,int64_t>> point(N);
    for(auto &[x, y] : point) cin >> x >> y;
    for(int64_t i = 0; i < N; i++){
        for(int64_t j = 1; j < N; j++){
            auto [xi, yi] = point[i];
            auto [xj, yj] = point[j];
            if(xi == xj){
                int64_t mn = INT64_MAX, mx = INT64_MIN;
                for(int64_t k = 0; k < N; k++){
                    if(k == i or k == j) continue;
                    mn = min(mn, point[k].first);
                    mx = max(mx, point[k].first);
                }
                res = max(res, abs(yi - yj) * abs(mn - mx));
                continue;
            }
            int64_t mn = 0;
            vector<int64_t> rem;
            for(int64_t k = 0; k < N; k++){
                if(k == i or k == j) continue;
                auto [xk, yk] = point[k];
                rem.push_back((xi - xk)*(yj - yk) - (xj - xk)*(yi - yk));
            }
            sort(rem.begin(), rem.end());
            if(rem[0] * rem.back() >= 0) continue;
            res = max(res, abs(rem[0]) + abs(rem.back()));
        }
    }
    cout << res << '\n';
}