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

int n, k, tot;
long long a[MAXN][MAXN], val[MAXN];
long long ans, now;
int id[MAXN];
vector<pair<long, long> > b[MAXN];
const long long inf = 0x3f3f3f3f3f3f3f3fll;

void dfs(const long long p) {
	if (p > n) {
		now = 0;
		for (int i = 1; i <= n; ++i) val[i] = b[i][id[i]].first, now -= b[i][id[i]].second;
		for (int i = 1; i <= n; ++i) for (int j = i; j <= n; ++j) {
			long long maxv = 0;
			for (int k = i; k <= j; ++k) maxv = max(maxv, val[k]);
			now += maxv * a[i][j];
		}
		ans = max(ans, now);
		return;
	}
	for (int i = 0; i < (int)b[p].size(); ++i) id[p] = i, dfs(p + 1);
	return;
}

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) {
		cin >> k; tot = 0;
		for (int j = 1; j <= k; ++j) {
			long long v, c; cin >> v >> c;
			b[i].push_back(make_pair(v, c));
		}
	}
	ans = -inf, dfs(1);
	cout << ans << "\n";
	return 0;
}