#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
vector<pair<int, int>> vc;
int main() {
		int n; scanf("%d", &n);
		for (int i = 0; i < n; i++) {
			int mx = -0x3f3f3f3f, mn = 0x3f3f3f3f;
			int m; scanf("%d", &m);
			vector<int> v(m); for (int j = 0; j < m; j++) {
				int x; scanf("%d", &x); mx = max(mx, x), mn = min(mn, x);
				v[j] = x;
			}
			vc.push_back({mn, mx});
		}
		sort(vc.begin(), vc.end());
		int cnt = 0, f = -1;
		for (int i = 0; i < n; i++) {
			cnt += f < vc[i].first;
			f = max(f, vc[i].second);
		}
		printf("%d\n", n * 2 - cnt);
}