# include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e6;
const long long MAXS = 1e7;
vector <pair <long long,long long> > p;
map <int,int> taken;
struct edge
{
    long long to, rev, flow, cap, cost;
    edge()
    {
        to = 0;
        rev = 0;
        flow = 0;
        cap = 0;
        cost = 0;
    }
    edge(long long _to, long long _rev, long long _flow, long long _cap, long long _cost)
    {
        to = _to;
        rev = _rev;
        flow = _flow;
        cap = _cap;
        cost = _cost;
    }
};
vector <edge> g[MAXN];
void add_edge(long long u, long long v, long long w, long long c)
{
    edge ed1 = edge(v,g[v].size(),0,w,c);
    edge ed2 = edge(u,g[u].size(),0,0,-c);
    g[u].push_back(ed1);
    g[v].push_back(ed2);
}
map <long long,long long> mp;
long long num = 1;
long long dist[MAXN];
const long long inf = LONG_MAX;
long long s = 0;
long long t = 1;
bool is_inside[MAXN];
deque <long long> q;
long long par_idx[MAXN],par[MAXN];
bool spfa() {
	for(long long i = 0; i <= num; i++)
		dist[i] = inf;
	dist[t] = inf;

	q.clear();
	dist[s] = 0;
	is_inside[s] = true;
	q.push_back(s);

	while(!q.empty()) {
		long long u = q.front();
		is_inside[u] = false;
		q.pop_front();

		for(long long i = 0; i < g[u].size(); i++)
			if(g[u][i].cap > g[u][i].flow && dist[u] + g[u][i].cost < dist[g[u][i].to]) {
				dist[g[u][i].to] = dist[u] + g[u][i].cost;
				par_idx[g[u][i].to] = i;
				par[g[u][i].to] = u;

				if(is_inside[g[u][i].to]) continue;
				if(!q.empty() && dist[g[u][i].to] > dist[q.front()]) q.push_back(g[u][i].to);
				else q.push_front(g[u][i].to);

				is_inside[g[u][i].to] = true;
			}
	}

	return dist[t] != inf;
}
long long mc_max_flow(long long n) {
	long long f = 0, ret = 0;
	while( spfa()) {
		long long u = t;
		long long mn_flow = inf;
	    while(u != s) {
			mn_flow = min(mn_flow, g[par[u]][par_idx[u]].cap - g[par[u]][par_idx[u]].flow);
			u = par[u];
		}

		u = t;
		while(u != s) {
         //       cout << u << "->";
			g[par[u]][par_idx[u]].flow += mn_flow;
			g[u][g[par[u]][par_idx[u]].rev].flow -= mn_flow;
			ret += g[par[u]][par_idx[u]].cost * mn_flow;
			u = par[u];
		}
     //   cout<<endl;
		f += mn_flow;
	//	cout<<"curr flow: "<<f<<endl;
	}
    if(f!=n)
    {
        return n*MAXS+1;
    }
	return ret;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    freopen ("clothes.in","r",stdin);  freopen ("clothes.out","w",stdout);
    long long n;
    cin >> n;
    long long i,j,x;

    for(i = 1; i<=n; i++)
    {
        cin>>x;
        num++;
        add_edge(0,num,1,0);
       // cout<<"row: "<<i<<" ::: "<<num<<endl;
        long long curr = num;
        p.clear();
        p.resize(x);
        for(j = 0; j<x; j++){
             cin>>p[j].second >> p[j].first;
             p[j].first = MAXS-p[j].first;
        }

        sort(p.begin(),p.end());
        long long br = 0;
        for(j = 0; j<x && br < n; j++)
        {
            if(taken[p[j].second]!=i)
            {
                taken[p[j].second]=i;
                br++;
                num++;
                add_edge(curr,num,1,p[j].first);
              //  cout<<"cloth "<<p[j].second << " "<<p[j].first <<" :: "<<num<<endl;
                long long tek = num;
                if(mp.find(p[j].second)==mp.end())
                {
                    num++;
                    mp[p[j].second] = num;
                    add_edge(num,1,1,0);
                 //   cout<<"col: "<<p[j].second << " ::" << num << endl;
                }
                long long col = mp[p[j].second];
                add_edge(tek,col,1,0);
            }
        }
    }

    long long ans = mc_max_flow(n);
    ans = n*MAXS - ans;
    cout<< ans << endl;
}