简易玄学算法，就挖#1这一个点，蒟蒻求助，大佬们快来看看！

#include<bits/stdc++.h>
using namespace std;
const long long MAXN=200001;
int n;
long long ans=0;
pair<long long, long long> a[MAXN];
long long dis(pair<long long, long long> a, pair<long long, long long> b)
{
	long long tx=a.first-b.first;
	long long ty=a.second-b.second;
  	return (1ll*tx*tx+1ll*ty*ty);
}
bool cmp(pair<long long, long long> x,pair<long long, long long> y)
{
	return x.first<y.first;
}
int main()
{
	cin>>n;
	for(long long i=1;i<=n;i++)
	{
		cin>>a[i].first>>a[i].second;
	}
    sort(a+1,a+n+1);
	for(long long i=1;i<=min(20000,n);i++)
	{
		for(long long j=n-min(20000,n);j<=n;j++)
		{
            ans=max(ans,dis(a[i],a[j]));
        }
	}
    cout<<ans<<endl;
	return 0;
}