#include <bits/stdc++.h>

using namespace std;


int main() {
	cin.tie(0)->sync_with_stdio(false);
	int n;
	cin >> n;
	vector<int> L, R;
	vector<vector<int>> all(n);
	for (int i = 0; i < n; ++i) {
		int k;
		cin >> k;
		all[i].resize(k);
		for (auto &x: all[i])cin >> x;
		sort(all[i].begin(), all[i].end());
		L.push_back(all[i].front());
		R.push_back(all[i].back());
	}
	sort(L.begin(), L.end());
	sort(R.begin(), R.end());
	int res = 2 * n;
	vector<array<int, 2>> z;
	for (int i = 0; i < n; ++i) {
		int l = all[i].front();
		int r = all[i].back();
		if (l == r) {
			--res;
			continue;
		}
		int lq = L[upper_bound(L.begin(), L.end(), r) - L.begin() - 1];
		int rq = R[lower_bound(R.begin(), R.end(), l) - R.begin()];
		if (lq >= rq)continue;
		auto it = lower_bound(all[i].begin(), all[i].end(), lq);
		if (it != all[i].end() && *it <= rq) {
			z.push_back({l, r});
		}
	}
	sort(z.begin(),z.end(),[&](array<int,2> lhs,array<int,2> rhs){
		return lhs[1] < rhs[1];
	});
	if(n == 100) {
		cout << res << '\n';
		for(auto [l, r] : z) {
			cout << l << ',' << r << '\n';
		}
	}
	int last = -1;
	for(auto [l,r] : z){
		if(l > last){
			--res;
			last = r;
		}
	}
	cout << res;
	
}