#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pr;
const ll inf=1e18;
int n,K[305];
ll f[305][305],s[305][305];
vector<pr> v[305];
ll S(int l1,int r1,int l2,int r2){
	return s[r1][r2]+s[l1-1][l2-1]-s[l1-1][r2]-s[r1][l2-1];
}
ll Query(ll x,ll k){
	ll l=0,r=v[x].size()-1;
	while(r-l>=3){
		ll m1=(l+l+r)/3,m2=(l+r+r)/3;
		if(v[x][m1].first*k-v[x][m1].second>v[x][m2].first*k-v[x][m2].second)r=m2-1;
		else l=m1+1;
	}
	ll ans=-inf;
	for(int i=l;i<=r;i++)ans=max(ans,v[x][i].first*k-v[x][i].second);
	return ans;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		for(int j=i;j<=n;j++)scanf("%lld",&s[i][j]);
		for(int j=1;j<=n;j++){
			s[i][j]+=s[i-1][j]+s[i][j-1]-s[i-1][j-1];
		}
	}
	for(int i=1;i<=n;i++){
		scanf("%d",&K[i]);
		for(int j=0;j<K[i];j++){
			ll x,y;
			scanf("%lld%lld",&x,&y);
			v[i].push_back(pr(x,y));
		}
		sort(v[i].begin(),v[i].end());
		vector<pr> tv;
		for(int j=0;j<K[i];j++){
			if(j>0&&v[i][j].first==v[i][j-1].first)continue;
			while(tv.size()>1&&((__int128)v[i][j].second-tv[tv.size()-1].second)*(tv[tv.size()-1].first-tv[tv.size()-2].first)<=((__int128)tv[tv.size()-1].second-tv[tv.size()-2].second)*(v[i][j].first-tv[tv.size()-1].first))tv.pop_back();
			tv.push_back(v[i][j]);
		}
		v[i]=tv;
	}
	for(int i=n;i>=1;i--){
		for(int j=i;j<=n;j++){
			f[i][j]=-inf;
			for(int k=i;k<=j;k++){
				f[i][j]=max(f[i][j],Query(k,S(i,k,k,j))+f[i][k-1]+f[k+1][j]);
			}
		}
	}
	cout<<f[1][n];
}