#include <cstdio>
#include <vector>
using namespace std;

#define N 105
int n;

int gcd(int a, int b) { return b==0?a:gcd(b,a%b); }
int lcm(int a, int b) { return a/gcd(a,b)*b; }

int solve(vector<pair<int,vector<int> > >& vss) {
  if (vss.size()==0) return 0;
	int cycle=1;
	for (size_t i=0;i<vss.size();++i) cycle=lcm(cycle,vss[i].second.size());
	int res=0;
	for (int i=0;i<cycle;++i) {
		int cnt=0;
		for (size_t j=0;j<vss.size();++j) 
			cnt+=vss[j].second[(vss[j].first+i)%vss[j].second.size()];
		res = max(res, cnt);
	}
	return res;
}

int main() {
	scanf("%d",&n);
	vector<pair<int,vector<int> > > vss0,vss13,vss17,vss19,vss23;
	for (int i=0;i<n;++i) {
		int t,s; scanf("%d%d",&t,&s);
		vector<int> vs(t);
		for (int j=0;j<t;++j) scanf("%d",&vs[j]);
		if (t==13) vss13.push_back(make_pair(s,vs));
		else if (t==17) vss17.push_back(make_pair(s,vs));
		else if (t==19) vss19.push_back(make_pair(s,vs));
		else if (t==23) vss23.push_back(make_pair(s,vs));
		else vss0.push_back(make_pair(s,vs));
	}
	printf("%d\n",solve(vss0)+solve(vss13)+solve(vss17)+solve(vss19)+solve(vss23));
}