#include <cstdio>

#include <cstring>

#include <algorithm>

#define N 1510

using namespace std;

typedef long long ll;

struct data

{

    ll len , px , py , dx , dy;

    bool operator<(const data &a)const {return len == a.len ? px == a.px ? py < a.py : px < a.px : len < a.len;}

}a[N * N];

ll x[N] , y[N];

int tot;

ll calc(int i , int j)

{

    return abs(a[i].dx * a[j].dy - a[i].dy * a[j].dx) >> 1;

}

int main()

{

    int n , i , j , k , l;

    ll ans = 0;

    scanf("%d" , &n);

    for(i = 1 ; i <= n ; i ++ )

    {

        scanf("%lld%lld" , &x[i] , &y[i]);

        for(j = 1 ; j < i ; j ++ )

        {

            a[++tot].len = (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);

            a[tot].px = x[i] + x[j] , a[tot].py = y[i] + y[j];

            a[tot].dx = x[i] - x[j] , a[tot].dy = y[i] - y[j];

        }

    }

    sort(a + 1 , a + tot + 1);

    for(i = j = 1 ; i <= tot ; i = j)

    {

        while(a[j].len == a[i].len && a[j].px == a[i].px && a[j].py == a[i].py) j ++ ;

        for(k = i ; k < j ; k ++ )

            for(l = k + 1 ; l < j ; l ++ )

                ans = max(ans , calc(k , l));

    }

    printf("%lld\n" , ans);

    return 0;

}