#include<bits/stdc++.h>

 #define N 1505

 #define ll long long

 using namespace std;

 int n,cnt;ll ans;

 struct P{

     int x,y;

     bool operator < (const P &b)const{return x==b.x?y<b.y:x<b.x;}

     P operator - (const P &b)const{return (P){x-b.x,y-b.y};}

     bool operator == (const P &b)const{return x==b.x&&y==b.y;}

 }p[N];

 struct line{

     ll len;P a,b,mid;

     bool operator < (const line &b)const{return len==b.len?mid<b.mid:len<b.len;}

 }l[N*N/];

 ll dis(P a,P b){return 1ll*(a.x-b.x)*(a.x-b.x)+1ll*(a.y-b.y)*(a.y-b.y);}

 ll crs(P a,P b){return 1ll*a.x*b.y-1ll*a.y*b.x;}

 void update(int i,int j){

     P a=l[i].a,c=l[j].a,d=l[j].b;

     P x=d-a,y=c-a;

     //if(!crs(y,l[i].mid))y=d-a;

     ll tmp=abs(crs(x,y));if(tmp>ans)ans=tmp;

 }

 int main(){

     scanf("%d",&n);

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

     scanf("%d%d",&p[i].x,&p[i].y);

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

         for(int j=i+;j<=n;j++){

             l[++cnt].len=dis(p[i],p[j]);

             l[cnt].a=p[i];l[cnt].b=p[j];

             l[cnt].mid=(P){p[i].x+p[j].x,p[i].y+p[j].y};

         }

     sort(l+,l++cnt);int j;

     for(int i=;i<=cnt;i++){

         j=i-;

         while(l[j].len==l[i].len&&l[j].mid==l[i].mid)update(i,j--);

     }

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

     return ;

 }