#pragma GCC optimize(2)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline","fast-math","unroll-loops","no-stack-protector")
#pragma GCC diagnostic error "-fwhole-program"
#pragma GCC diagnostic error "-fcse-skip-blocks"
#pragma GCC diagnostic error "-funsafe-loop-optimizations"
// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\33[32m[" << __LINE__ << "]\33[m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T& x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T& x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = - f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 5e5 + 10;
int n, p[N], m, tl[N], tr[N], info[N];
vector <int> v[N], g;
bool flag[N];
void modify(int x, int y) {
	for (; x < N; x += x & - x) chkmax(info[x], y);
}
int query(int x) {
	int mx = 0;
	for (; x; x ^= x & - x) chkmax(mx, info[x]);
	return mx;
}
signed main() {
	read(n);
	F(i, 1, n) {
		p[i] = i;
		int k; read(k);
		v[i].resize(k);
		for (int& j: v[i]) read(j), g.push_back(j);
		sort(all(v[i]));
		tl[i] = v[i].front();
		tr[i] = v[i].back();
	}
	sort(all(g));
	g.resize(m = unique(all(g)) - g.begin());
	F(i, 1, n)
		for (int& j: v[i])
			j = lower_bound(all(g), j) - g.begin() + 1;
	sort(p + 1, p + n + 1, [&] (int x, int y) {
		return v[x].back() < v[y].back();
	});
	set <int> w;
	int mx = 0;
	F(i, 1, n) {
		auto it = w.lower_bound(v[p[i]].front());
		if (it != w.end()) {
			chkmin(tr[p[i]], * it);
			chkmax(tl[p[i]], mx);
		}
		chkmax(mx, v[p[i]].front());
		w.insert(v[p[i]].back());
	}
	w.clear();
	// int mn = 1e9;
	DF(i, n, 1) {
		auto it = w.lower_bound(v[p[i]].back());
		if (it != w.begin()) {
			it--;
			chkmax(tl[p[i]], * it);
			// chkmin(tr[p[i]], mn);
		}
		// chkmin(mn, v[p[i]].front());
		w.insert(v[p[i]].front());
	}
	F(i, 1, n)
		for (int j: v[i]) flag[i] |= tl[i] <= j && j <= tr[i];
	int ans = 0;
	F(i, 1, n) {
		int g = query(v[i].front()) + 1;
		chkmax(ans, g);
		modify(v[i].back(), g);
	}
	cout << n * 2 - ans;
	return 0;
}
/* why?
*/