#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
using u64 = unsigned long long;
using db = double;
const int mod = 998244353;
using pr = std::pair<int, int>;

int n;
struct p2 {
	int x, y;
};
p2 operator + (p2 x, p2 y) { return {x.x + y.x, x.y + y.y}; }
p2 operator - (p2 x, p2 y) { return {x.x - y.x, x.y - y.y}; }

ll operator * (p2 x, p2 y) {
	return (ll) x.x * y.y - (ll) x.y * y.x;
}
bool operator < (const p2 & x, const p2 & y) {
	if(x.y != y.y) return x.y < y.y;
	return x.x < y.x;
}
using hull = std::vector<p2>;
int half(p2 x) {
	return x.y < 0 || (x.y == 0 && x.x <= 0);
}
int cmp(p2 a, p2 b) {
	return half(a) == half(b) ? a * b > 0 : half(b);
}
hull conv(hull a, hull b) {
	rotate(a.begin(), min_element(a.begin(), a.end()), a.end());
	rotate(b.begin(), min_element(b.begin(), b.end()), b.end());
	std::vector<p2> x(a.size() - 1);
	std::vector<p2> y(b.size() - 1);
	for(int i = 0;i + 1 < (int) a.size();++i) {
		x[i] = a[i + 1] - a[i];
	}
	for(int i = 0;i + 1 < (int) b.size();++i) {
		y[i] = b[i + 1] - b[i];
	}
	std::vector<p2> ans(a.size() + b.size() - 1);
	merge(x.begin(), x.end(), y.begin(), y.end(), ans.begin() + 1, cmp);
	ans[0] = a[0] + b[0];
	for(int i = 1;i < (int) ans.size();++i) {
		ans[i] = ans[i - 1] + ans[i];
	}
	for(int i = 2;i < (int) ans.size();++i) {
	//	assert((ans[i - 1] - ans[0]) * (ans[i] - ans[0]) >= 0);
	//	assert((ans[i - 1] - ans[i - 2]) * (ans[i] - ans[i - 2]) >= 0);
	}
	return ans;
}
ll cross(p2 x, p2 y, p2 z) {
	return (y - x) * (z - x);
}
hull un(hull o, hull b) {
	o.insert(o.end(), b.begin(), b.end());
	sort(o.begin(), o.end(), [&](p2 x, p2 y) {
		return x.x == y.x ? x.y < y.y : x.x < y.x;
	});
	o.erase(unique(o.begin(), o.end(), [](p2 x, p2 y) {
		return x.x == y.x && x.y == y.y;
	}), o.end());
	std::vector<p2> s;
	for(int i = 0;i < (int) o.size();++i) {
		for(;s.size() >= 2 && cross(s.rbegin()[1], s.back(), o[i]) <= 0;) {
			s.pop_back();
		}
		s.push_back(o[i]);
	}
	for(int i = o.size() - 2, t = s.size();i >= 0;--i) {
		for(;s.size() > t && cross(s.rbegin()[1], s.back(), o[i]) <= 0;) {
			s.pop_back();
		}
		s.push_back(o[i]);
	}
	if(s.size() > 1) s.pop_back();
	return s;
}


const int N = 1e4 + 10;
std::vector<int> son[N];
p2 a[N];
std::vector<p2> get(int x) {
	if(son[x].empty()) {
		return {a[x]};
	}
	std::vector<std::vector<p2>> v;
	for(int i : son[x]) {
		v.push_back(get(i));
	}
	auto s = [&](auto s, int l, int r) {
		if(l + 1 == r) {
			auto A = v[l], B = v[l];
			for(auto & [x, y] : A) x *= -1, y *= -1;
			return std::make_pair(A, B);
		}
		int mid = (l + r) >> 1;
		auto [a0, a1] = s(s, l, mid);
		auto [b0, b1] = s(s, mid, r);
		return std::make_pair(
			conv(a0, b0),
			un(conv(a0, b1), conv(a1, b0))
		);
	};
	auto [a, b] = s(s, 0, v.size());
	return b;
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
//	std::mt19937 gen;
//	std::vector<p2> A, B;
//	for(int i = 0;i < 20;++i) {
//		A.push_back({gen()%100,gen()%100});
//		B.push_back({gen()%100,gen()%100});
//	}
//	A = un(A, {});
//	B = un(B, {});
//	auto C = conv(A, B);

	cin >> n;
	for(int i = 1;i <= n;++i) {
		int k; cin >> k;
		son[i].resize(k);
		for(int & x : son[i]) cin >> x;
		if(!k) cin >> a[i].x >> a[i].y;
	}
	auto conv = get(1);
	ll ans = 0;
	for(auto [u, v] : conv) {
		ans = std::max(ans, (ll) u * u + (ll) v * v);
	}
	cout << ans << '\n';
}