#include<bits/stdc++.h>

#define endl '\n'
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define pb push_back
#define eb emplace_back
#define debug(x) cout << #x << ": " << x << endl
// #define debug(...) 
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)((x).size())
#define esp ' '
#define pii pair<int,int>
#define vi vector<int>

typedef long long ll;
const int oo = 1e9+1;

using namespace std;

void solve() {
	int n; cin >> n;
	vector<pair<int, int>> rgs(n);
	vector<int> ls(n), rs(n);
	int ans = 0;
	int sum = 0;
	rep(i, 0, n) {
		int k; cin >> k;
		sum += k;
		int minv = oo;
		int maxv = -oo;
		rep(j, 0, k) {
			int x; cin >> x;
			minv = min(minv, x);
			maxv = max(maxv, x);
		}
		ans += k -2;
		if (minv == maxv) ans++;
		rgs[i] = {minv, maxv};
		ls[i] = minv;
		rs[i] = maxv;
	}
	sort(all(rgs));
	sort(all(ls));
	sort(all(rs));

	auto query = [&](int l, int r, const vector<int> & v) {
		int bigr = lower_bound(all(v), r) - v.begin();
		int small = upper_bound(all(v), l) - v.begin();
		return max(bigr - small, 0);
	};

	vector<int> dp(n+1, 0);

	dp[n] = 0;
	for (int i = n-1; i >= 0; i--) {
		int nxt = upper_bound(all(rgs), pair{rgs[i].second +1, (int)-1}) - rgs.begin();
		dp[i] = dp[i+1];
		if (rgs[i].first == rgs[i].second) continue;
		if (query(rgs[i].first, rgs[i].second, ls) == 0) {
			dp[i] = max(dp[i], 1 + dp[nxt]);
		}
		if (query(rgs[i].first, rgs[i].second, rs) == 0) {
			dp[i] = max(dp[i], 1 + dp[nxt]);
		}
	}
	// debug(ans);
	// debug(dp[0]);

	cout << sum - (dp[0] + ans) << endl;

}

signed main() {
	ios_base::sync_with_stdio(0);cin.tie(0);

	int t=1;
	//cin>>t;
	while(t--) solve();
}