#include <bits/stdc++.h>
#define X first
#define Y second
#define PB push_back
#define x first
#define y second
#define pb push_back
using namespace std;
using ll=long long;
using vi=vector<int>;
using vl=vector<ll>;
using pii=pair<int,int>;
#define all(a) begin(a),end(a)

const int N=300010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

int n, L[N], R[N], red[N];
vector<pii> v;
vector<int> saz;
int loga[N], uzeo[N];

void add(int x) {
	for(x++; x < N; x += x & -x) loga[x]++;
}

int get(int x) {
	int ret = 0;
	for(x++; x ; x -= x & -x) ret += loga[x];
	return ret;
}

bool cmp(int A, int B) {
	return R[A] < R[B];
}

bool cmp2(int A, int B) {
	return L[A] < L[B];
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	
	cin >> n;
	for (int i = 0; i < n; ++i) {
		int k; cin >> k;
		vi a(k);
		for (int j = 0; j < k; ++j) cin >> a[j];
		sort(a.begin(), a.end());
		L[i] = a[0], R[i] = a.back();
		saz.PB(L[i]), saz.PB(R[i]);
	}
	sort(saz.begin(), saz.end());
	saz.erase(unique(saz.begin(), saz.end()), saz.end());
	for(int i = 0;i < n;i++) {
		L[i] = lower_bound(saz.begin(), saz.end(), L[i]) - saz.begin();
		R[i] = lower_bound(saz.begin(), saz.end(), R[i]) - saz.begin();
		red[i] = i;
	}
	sort(red, red + n, cmp);
	for(int i = 0;i < n;i++) {
		int x = red[i];
		if(get(L[x]) != i) {
			uzeo[x] = 1;
		}
		add(L[x]);
	}
	int sol = 0;
	vector < int > jos;
	for(int i = 0;i < n;i++) {
		if(!uzeo[i]) {
			if(L[i] != R[i]) jos.PB(i);
			else sol++;
		}
	}
	sort(jos.begin(), jos.end(), cmp2);
	int dos = -1;
	for(int x : jos) {
		if(dos < L[x]) {
			dos = R[x]; sol++;
		}
	}
	cout << 2 * n - sol << endl;
	return 0;
}