#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,ans;
struct vec{
	int x,y;
	vec friend operator+(vec a,vec b){
		return {a.x+b.x,a.y+b.y};
	}
	vec friend operator-(vec a,vec b){
		return {a.x-b.x,a.y-b.y};
	}
	int norm(){
		return x*x+y*y;
	}
	int det(vec b){
		return x*b.y-y*b.x;
	}
	int dot(vec b){
		return x*b.x+y*b.y;
	}
}v[200005];
bool cmp(vec a,vec b){
	if(a.y*b.y<0)return a.y>b.y;
	return a.det(b)>0;
}
signed main(){
	scanf("%lld",&n);
	for(int i=1;i<=n;i++)scanf("%lld%lld",&v[i].x,&v[i].y);
	sort(v+1,v+n+1,cmp);
	//for(int i=1;i<=n;i++)cout<<v[i].x<<" "<<v[i].y<<endl;
	vec now={0,0};
	for(int i=1,l=1,r=0;i<=n;i++){
		while(r+1<=n&&v[i].dot(v[r+1])>=0)r++,now=now+v[r];
		while(l<=i&&v[l].dot(v[i])<0)now=now-v[l],l++;
		ans=max(ans,now.norm());
		//cout<<i<<" "<<l<<" "<<r<<endl;
	}
	printf("%lld",ans);
}