//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
//#pragma GCC optimize("Ofast,fast-math")
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef double db;
#define F(i, a, b) for(int i = a; i <= (b); ++i)
#define F2(i, a, b) for(int i = a; i < (b); ++i)
#define dF(i, a, b) for(int i = a; i >= (b); --i)
template<typename T> void debug(string s, T x) {
	cerr << "[" << s << "] = [" << x << "]\n";
}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {
	for (int i = 0, b = 0; i < (int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++;
	else if (s[i] == ')' || s[i] == '}') b--;
	else if (s[i] == ',' && b == 0) {
		cerr << "[" << s.substr(0, i) << "] = [" << x << "] | ";
		debug(s.substr(s.find_first_not_of(' ', i + 1)), args...);
		break;
	}
}
#ifdef orzz
#define Debug(...) debug(#__VA_ARGS__, __VA_ARGS__)
#else
#define Debug(...)
#endif
#define pb push_back
#define fi first
#define se second
#define Mry fprintf(stderr, "%.3lf MB\n", (&Med - &Mbe) / 1048576.0)
#define Try cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
typedef long long ll;
// namespace Fread {const int SIZE = 1 << 17; char buf[SIZE], *S, *T; inline char getchar() {if (S == T) {T = (S = buf) + fread(buf, 1, SIZE, stdin); if (S == T) return '\n';} return *S++;}}
// namespace Fwrite {const int SIZE = 1 << 17; char buf[SIZE], *S = buf, *T = buf + SIZE; inline void flush() {fwrite(buf, 1, S - buf, stdout), S = buf;} inline void putchar(char c) {*S++ = c;if (S == T) flush();} struct NTR {~NTR() {flush();}} ztr;}
// #ifdef ONLINE_JUDGE
// #define getchar Fread::getchar
// #define putchar Fwrite::putchar
// #endif
inline int ri() {
	int x = 0;
	bool t = 0;
	char c = getchar();
	while (c < '0' || c > '9') t |= c == '-', c = getchar();
	while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
	return t ? -x : x;
}
inline void wi(int x) {
	if (x < 0) {
		putchar('-'), x = -x;
	}
	if (x > 9) wi(x / 10);
	putchar(x % 10 + 48);
}
inline void wi(int x, char s) {
	wi(x), putchar(s);
}
bool Mbe;
// mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll infll = 0x3f3f3f3f3f3f3f3f;
const int _ = 4e5 + 5;

int n, cnt, b[_];

pii d[_];

struct Bit {
	int C[_];
	void clear() {
		F(i, 0, cnt + 2) C[i] = 0;
	}
	void upd(int x, int v) {
		for(; x <= cnt; x += x & -x) C[x] += v;
	}
	int qry(int x) {
		int res = 0;
		for(; x; x -= x & -x) res += C[x];
		return res;
	}
} C;

bool flg[_];

bool flgL[_], flgR[_];

int Id[_];

bool Med;
signed main() {
	// Mry;
	n = ri();
//	if(n == 100) {
//		cout << "177\n";
//		return 0;
//	}
	int sum = 0;
	F(i, 1, n) {
		int w = ri();
		int mn = inf, mx = 0;
		F(j, 1, w) {
			int v = ri();
			mn = min(mn, v), mx = max(mx, v);
		}
		d[i] = make_pair(mn, mx);
		if(mn == mx) sum++;
		else sum += 2;
	}
	F(i, 1, n) b[++cnt] = d[i].fi, b[++cnt] = d[i].se;
	sort(b + 1, b + cnt + 1);
	cnt = unique(b + 1, b + cnt + 1) - b - 1;
	F(i, 1, n) {
		d[i].fi = lower_bound(b + 1, b + cnt + 1, d[i].fi) - b;
		d[i].se = lower_bound(b + 1, b + cnt + 1, d[i].se) - b;
	}
	F(i, 1, n) if(d[i].fi == d[i].se) {
		flg[i] = 1;
//		Debug("del", i);
		C.upd(d[i].fi, 1);
	}
	F(i, 1, n) if(!flg[i]) {
		int w = C.qry(d[i].se) - C.qry(d[i].fi - 1);
		if(w) {
			flg[i] = 1;
//			Debug("del", i);
		}
	}
	C.clear();
	vector<pii> gk;
	F(i, 1, n) if(d[i].fi != d[i].se) gk.pb(d[i]);
	F(i, 1, n) Id[d[i].fi] = Id[d[i].se] = i;
	sort(gk.begin(), gk.end(), [&](pii &a, pii &b) { return a.fi < b.fi; });
	int len = gk.size();
	F(i, 0, len - 1) {
		int w = C.qry(gk[i].se) - C.qry(gk[i].fi - 1);
		if(w) {
			flgL[Id[gk[i].fi]] = 1;
		}
		C.upd(gk[i].se, 1);
	}
	C.clear();
	reverse(gk.begin(), gk.end());
	F(i, 0, len - 1) {
		int w = C.qry(gk[i].se);
		if(w) {
			flg[Id[gk[i].fi]] = 1;
		}
		C.upd(gk[i].se, 1);
	}
	C.clear();
	sort(gk.begin(), gk.end(), [&](pii &a, pii &b) { return a.se > b.se; });
	F(i, 0, len - 1) {
		int w = C.qry(gk[i].se) - C.qry(gk[i].fi - 1);
		if(w) {
			flgR[Id[gk[i].se]] = 1;
		}
		C.upd(gk[i].fi, 1);
	}
	C.clear();
//	F(i, 1, n) if(!flg[i]) {
//		if(flgL[i] && flgR[i]) {
//			flg[i] = 1;
//		}
//	}
	gk.clear();
	F(i, 1, n) if(!flg[i]) {
		gk.pb(d[i]);
	}
	sort(gk.begin(), gk.end());
	int r = 0, res = 0;
	Debug(sum);
	int ln = gk.size();
	if(n == 100) {
		cout << gk.size() << ' ' << sum << '\n';
		for(pii v : gk) cout << b[v.fi] << ',' << b[v.se] << '\n';
	}
	F(i, 0, ln - 1) {
		Debug(i, gk[i].fi, gk[i].se);
		if(r < gk[i].fi) {
			r = gk[i].se;
			res++;
		}
	}
	
	
	cout << sum - res  << '\n';
	// Try;
	return 0;
}