#include<cmath>

#include<queue>

#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

const int N=1e5+;

inline int read(){

    int X=,w=;char ch=;

    while(!isdigit(ch)){w|=ch=='-';ch=getchar();}

    while(isdigit(ch))X=(X<<)+(X<<)+(ch^),ch=getchar();

    return w?-X:X;

}

struct Point{

    int x,y;

    Point(int x0=,int y0=){x=x0,y=y0;}

};

int dis(Point a,Point b){//求两点距离平方

    return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);

}

typedef Point Vector;

Vector operator +(Point a,Point b){return Vector(a.x+b.x,a.y+b.y);}

Vector operator -(Point a,Point b){return Vector(a.x-b.x,a.y-b.y);}

Vector operator *(Point a,int k){return Vector(a.x*k,a.y*k);}

Vector operator /(Point a,int k){return Vector(a.x/k,a.y/k);}

int Dot(Vector a,Vector b){//求点积

    return a.x*b.x+a.y*b.y;

}

int Cross(Vector a,Vector b){//求叉积

    return a.x*b.y-b.x*a.y;

}

int Cross(Point sp,Point ep,Point op){//得到sp-op和ep-op的叉积

    return (sp.x-op.x)*(ep.y-op.y)-(ep.x-op.x)*(sp.y-op.y);

}

Point p[N],q[N];

int n,k,m;

inline bool cmp(int u,int v){

    int det=Cross(p[u],p[v],p[]);

    if(det!=)return det>;

    return dis(p[],p[u])<dis(p[],p[v]);

}

void graham(){

    int id=;

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

        if(p[i].x<p[id].x||(p[i].x==p[id].x&&p[i].y<p[id].y))

            id=i;

    if(id!=)swap(p[],p[id]);

    static int per[N];

    for(int i=;i<=n;i++)per[i]=i;

    sort(per+,per+n+,cmp);

    q[++m]=p[];

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

        int j=per[i];

        while(m>=&&Cross(p[j],q[m],q[m-])>=)m--;

        q[++m]=p[j];

    }

    return;

}

int calliper(){

    if(m==)return dis(q[],q[]);

    q[m+]=q[];

    int res=;

    for(int i=,j=;i<=m;i++){

        while(Cross(q[i+],q[j],q[i])<Cross(q[i+],q[j+],q[i])){

            j++;if(j>m)j=;

        }

        res=max(res,dis(q[i],q[j]));

    }

    return res;

}

int main(){

    n=read();

    for(int i=;i<=n;i++)p[i].x=read(),p[i].y=read();

    graham();

    printf("%d\n",calliper());

    return ;

}