#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const long long o=10010;
struct Point{
	long long x,y;
	Point(long long _x=0,long long _y=0):x(_x),y(_y){}
	Point operator+(Point b)const{return Point(x+b.x,y+b.y);}
	Point operator-(Point b)const{return Point(x-b.x,y-b.y);}
	long long operator*(Point b)const{return x*b.x+y*b.y;}
	long long operator^(Point b)const{return x*b.y-y*b.x;}
	Point operator*(long long b)const{return Point(x*b,y*b);}
	long long normsqr(){return x*x+y*y;}
};
Point p1;
inline bool cmp(Point p2,Point p3){
	long long t=(p1-p3)^(p2-p3);
	return t>0||(!t&&((p1-p2)*(p1-p2))<((p1-p3)*(p1-p3)));
}
vector<Point> graham(vector<Point> p){
	if(p.empty()) return p;
	vector<Point> res;
	p1=p[0];
	for(int i=p.size();i--;) if(p[i].y<p1.y) p1=p[i];
	sort(p.begin(),p.end(),cmp);
	for(int i=0,sz=p.size();i<sz;res.push_back(p[i++]))
		for(;(int)res.size()>1&&((res.back()-res[res.size()-2])^(p[i]-res[res.size()-2]))<=0;res.pop_back());
	return res;
}
inline void point_to_edge(vector<Point>&res,long long&x,long long &y,vector<Point> vec){
	x+=vec[0].x;y+=vec[0].y;
	for(int i=1,sz=vec.size();i<sz;++i) res.push_back(vec[i]-vec[i-1]);
	if((int)vec.size()>1) res.push_back(vec[0]-vec.back());
}
inline bool Cmp(Point A,Point B){
	bool x=(A.y>0||(A.y==0&&A.x>0)),y=(B.y>0||(B.y==0&&B.x>0));
	if(x^y) return x;
	return (A^B)>0;
}
inline void edge_to_point(vector<Point>&res,long long x,long long y,vector<Point> vec){
	if(vec.empty()) res.push_back(Point(x,y));
	sort(vec.begin(),vec.end(),Cmp);
	for(int i=0,sz=vec.size();i<sz;++i) res.push_back(Point(x,y)),x+=vec[i].x,y+=vec[i].y;
}
int n;long long ans,dx[o],dy[o];vector<int> sn[o];vector<Point> conv[o];
void dfs(int nw){
	if(sn[nw].empty()) return;
	for(int i=sn[nw].size();i--;) dfs(sn[nw][i]);
	long long Dx,Dy;vector<Point> vec,t; 
	for(int i=sn[nw].size();i--;edge_to_point(conv[nw],Dx,Dy,vec)){
		Dx=dx[sn[nw][i]];Dy=dy[sn[nw][i]];vec=conv[sn[nw][i]];
		for(int j=sn[nw].size();j--;) if(i^j){
			t.clear();edge_to_point(t,dx[sn[nw][j]],dy[sn[nw][j]],conv[sn[nw][j]]);
			for(int k=t.size();k--;) t[k].x*=-1,t[k].y*=-1;
			point_to_edge(vec,Dx,Dy,graham(t));
		}
	}
	if(nw==1) for(int i=conv[nw].size();i--;) ans=max(ans,conv[nw][i].normsqr());
	else vec=conv[nw],conv[nw].clear(),point_to_edge(conv[nw],dx[nw],dy[nw],graham(vec));
}
int main(){
	scanf("%d",&n);
	for(int i=1,k,t;i<=n;++i){
		scanf("%d",&k);
		if(!k) scanf("%lld%lld",&dx[i],&dy[i]);
		for(;k--;sn[i].push_back(t)) scanf("%d",&t);
	}
	dfs(1);
	printf("%lld",ans);
	return 0;
}