#include<iostream>
#include<fstream>
#include<vector>
#include<cmath>

using namespace std;

const int MAXN = 405;

int n;
pair <long long, long long> a[MAXN];

long long uLMin = LONG_MAX, uRMin = LONG_MAX, dLMin = LONG_MAX, dRMin = LONG_MAX;
pair <long long, long long> upLeft, upRight, downLeft, downRight;


long long x, y, x1, y1, x2, y2;
long long calcFace(pair <long long, long long> A, pair <long long, long long> B, pair <long long, long long> C)
{
    x = A.first;
    y = A.second;

    x1 = B.first;
    y1 = B.second;

    x2 = C.first;
    y2 = C.second;

    return (x*y1 + y*x2 + x1*y2) - (y*x1 + x*y2 + y1*x2);
}

int main()
{
    ifstream("fence.in");
    ofstream("fence.out");

    long long currentFace, f1, f2, f3;
    long long minFace = LONG_MAX;

    pair <long long, long long> O;
    O.first = 0;O.second = 0;

    cin >> n;
    for(int i = 0;i<n;i++)
    {
        cin >> a[i].first >> a[i].second;

        if(a[i].first>0 && a[i].second>0)
        {
            if(a[i].first*a[i].first + a[i].second*a[i].second<uRMin)
            {
                upRight = a[i];
                uRMin = a[i].first*a[i].first + a[i].second*a[i].second;
            }
        }
        else if(a[i].first>0 && a[i].second<0)
        {
            if(a[i].first*a[i].first + a[i].second*a[i].second<dRMin)
            {
                downRight = a[i];
                dRMin = a[i].first*a[i].first + a[i].second*a[i].second;
            }
        }
        else if(a[i].first<0 && a[i].second>0)
        {
            if(a[i].first*a[i].first + a[i].second*a[i].second<uLMin)
            {
                upLeft = a[i];
                uLMin = a[i].first*a[i].first + a[i].second*a[i].second;
            }
        }
        else if(a[i].first<0 && a[i].second<0)
        {
            if(a[i].first*a[i].first + a[i].second*a[i].second<dLMin)
            {
                downLeft = a[i];
                dLMin = a[i].first*a[i].first + a[i].second*a[i].second;
            }
        }
    }

    for(int i = 0;i<n-2;i++)
    {
        for(int j = i+1;j<n-1;j++)
        {
            for(int k = j+1;k<n;k++)
            {
                currentFace = calcFace(a[i], a[j], a[k]);

                f1 = calcFace(a[i], a[j], O);
                f2 = calcFace(a[j], a[k], O);
                f3 = calcFace(a[k], a[i], O);

                if(f1+f2+f3==currentFace && (f1<0)==(currentFace<0) && (f2<0)==(currentFace<0) && (f3<0)==(currentFace<0)
                   && calcFace(a[i], O, a[j])!=0 && calcFace(a[j], O, a[k])!=0 && calcFace(a[i], O, a[k])!=0)
                {
                    currentFace = abs(currentFace);
                    minFace = min(minFace, currentFace);

                    //cout << i << " " << j << " " << k << '\n';
                }
            }
        }
    }

    if(uLMin!=LONG_MAX && uRMin!=LONG_MAX && dLMin!=LONG_MAX && dRMin!=LONG_MAX)
    {
        currentFace = abs( calcFace(upRight, downRight, downLeft) ) + abs( calcFace(downLeft, upLeft, upRight) );
        minFace = min(minFace, currentFace);
    }

    uLMin = LONG_MAX;
    uRMin = LONG_MAX;
    dLMin = LONG_MAX;
    dRMin = LONG_MAX;
    for(int i = 0;i<n;i++)
    {
        if(a[i]==O) continue;
        if(a[i].first!=0 && a[i].second!=0) continue;

        if(a[i].first==0 && a[i].second>0)
        {
            //cout << "1" << '\n';

            if(a[i].first*a[i].first + a[i].second*a[i].second<uRMin)
            {
                upRight = a[i];
                uRMin = a[i].first*a[i].first + a[i].second*a[i].second;
            }
        }
        else if(a[i].first==0 && a[i].second<0)
        {
            //cout << "2" << '\n';

            if(a[i].first*a[i].first + a[i].second*a[i].second<dRMin)
            {
                downRight = a[i];
                dRMin = a[i].first*a[i].first + a[i].second*a[i].second;
            }
        }
        else if(a[i].first<0 && a[i].second==0)
        {
            //cout << "3" << '\n';

            if(a[i].first*a[i].first + a[i].second*a[i].second<uLMin)
            {
                upLeft = a[i];
                uLMin = a[i].first*a[i].first + a[i].second*a[i].second;
            }
        }
        else if(a[i].first>0 && a[i].second==0)
        {
            //cout << "4" << '\n';

            if(a[i].first*a[i].first + a[i].second*a[i].second<dLMin)
            {
                downLeft = a[i];
                dLMin = a[i].first*a[i].first + a[i].second*a[i].second;
            }
        }
    }

    //cout << uLMin << " " << dLMin << '\n';
    if(uLMin!=LONG_MAX && uRMin!=LONG_MAX && dLMin!=LONG_MAX && dRMin!=LONG_MAX)
    {

        currentFace = abs( calcFace(upRight, downRight, downLeft) ) + abs( calcFace(downLeft, upLeft, upRight) );
        minFace = min(minFace, currentFace);
    }

    cout << minFace << '\n';

}