#include <bits/stdc++.h>
#define MAXN 310
#define MAXK 300010
using namespace std;

int n, k, tot;
long long a[MAXN][MAXN], s[MAXN][MAXN], w[MAXN][MAXN][MAXN], val[MAXN][MAXN][MAXN], dp[MAXN][MAXN];
const long long inf = 0x3f3f3f3f3f3f3f3fll;
struct Point{long long x, y;};
Point b[MAXK], h[MAXK];

bool cmp(const Point a, const Point b) {return a.x == b.x ? a.y < b.y : a.x < b.x;}
Point operator-(Point a, Point b) {a.x -= b.x, a.y -= b.y; return a;}
long double cprod(Point a, Point b) {return (long double)a.x / b.x - (long double)a.y / b.y;}
long long getb(const long long k, const Point a) {return a.y - a.x * k;}
void Add(const Point a) {
	while (tot > 1 && cprod(h[tot] - h[tot - 1], a - h[tot]) >= 0) --tot;
	h[++tot] = a;
	return;
}

long long getval(const long long k) {
	int l = 1, r = tot, mid;
	while (l < r) {
		mid = (l + r) >> 1;
		if (getb(k, h[mid]) < getb(k, h[mid + 1])) l = mid + 1;
		else r = mid;
	}
	return getb(k, h[l]);
}

int main()
{
	cin >> n;
	for (int i = 1; i <= n; ++i) for (int j = i; j <= n; ++j) cin >> a[i][j];
	for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) s[i][j] = s[i][j - 1] + s[i - 1][j] - s[i - 1][j - 1] + a[i][j];
	for (int i = 1; i <= n; ++i) for (int j = i; j <= n; ++j) for (int k = i; k <= j; ++k) w[k][i][j] = s[k][j] - s[k][k - 1] - s[i - 1][j] + s[i - 1][k - 1];
	for (int i = 1; i <= n; ++i) {
		cin >> k; tot = 0;
		for (int j = 1; j <= k; ++j) {
			long long v, c; cin >> v >> c;
			b[j] = Point{-v, -c};
		}
		sort(b + 1, b + k + 1, cmp);
		for (int j = 1; j <= k; ++j) Add(b[j]);
		// for (int j = 1; j <= tot; ++j) cout << h[j].x << " " << h[j].y << "\n";
		for (int l = 1; l <= i; ++l) for (int r = i; r <= n; ++r) {
			val[i][l][r] = getval(w[i][l][r]);
		}
	}
	for (int len = 1; len <= n; ++len) for (int l = 1, r = len; r <= n; ++l, ++r) {
		dp[l][r] = -inf;
		for (int p = l; p <= r; ++p) dp[l][r] = max(dp[l][r], dp[l][p - 1] + dp[p + 1][r] + val[p][l][r]);
	}
	// for (int i = 1; i <= n; ++i, cout << "\n") for (int l = 1; l <= i; ++l, cout << "\n") for (int r = i; r <= n; ++r) cout << val[i][l][r] << " ";
	cout << dp[1][n] << "\n";
	return 0;
}