#include <bits/stdc++.h>

using namespace std;

const int maxn = 2e5 + 5;

int n, ans;
vector<pair<int, int> > all, vec[maxn];

inline void solve_contain(){
    vector<pair<int, int> > all_new;
    sort(all.begin(), all.end(), [&] (const pair<int, int> &ths, const pair<int, int> &oth) { return ths.second < oth.second; });
    int mxl = 0;
    for (auto p: all) {
        if (mxl > p.first) continue; // this interval contains others, single point never contain others
        mxl = max(mxl, p.first);
        if (p.first != p.second) all_new.push_back(p);
    }
    all = all_new;
    // for (auto p: all) printf("(%d %d) ", p.first, p.second); puts("");
}

int main(){
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
        int cnt; scanf("%d", &cnt);
        int mn = (int)(1e9) + 1, mx = 1;
        for (int j = 0; j < cnt; ++j) {
            int x; scanf("%d", &x);
            mn = min(mn, x);
            mx = max(mx, x);
        }
        if (cnt >= 2) ans += 2;
        else ans += 1;
        all.push_back(make_pair(mn, mx));
    }

    solve_contain();

    // printf("ans = %d\n", ans);

    int L = (int)(1e9) + 1, R = 0, tot = 0;
    for (auto p: all) {
        if (p.first < R) {
            vec[tot].push_back(p);
            L = min(L, p.first);
            R = max(R, p.second);
        }
        else {
            ++tot;
            vec[tot].push_back(p);
            L = p.first, R = p.second;
        }
    }

    for (int i = 1; i <= tot; ++i) {
        pair<int, int> mn = vec[i][0], mx = vec[i][0];
        // for (auto p: vec[i]) printf("(%d %d) ", p.first, p.second); puts("");
        for (auto p: vec[i]) {
            if (p.first < mn.first) mn = p;
            if (p.second > mx.first) mx = p;
        }
        if (mn.second < mx.first) ans -= 2; // non-intersect => 2 is ok
        else ans -= 1; // only 1
    }

    printf("%d\n", ans);
    return 0;
}

/*
4
3 4 7 10
2 1 9
4 11 2 8 14
3 6 12 13

4
1 1
1 2
1 3
1 4
*/