#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) { return (ull)rng() % B; }
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<vector<int>> v(n);
    vector<pair<int, int>> in(n), out(n);
    for (int i = 0; i < n; ++i) {
        int m;
        cin >> m;
        v[i].resize(m);
        for (int j = 0; j < m; ++j) {
            cin >> v[i][j];
        }
        sort(v[i].begin(), v[i].end());
        in[i] = {v[i][0], i};
        out[i] = {v[i].back(), i};
    }
    sort(in.begin(), in.end());
    sort(out.begin(), out.end());
    in.emplace_back(2e9, -1);
    out.emplace_back(2e9, -1);

    vector<pair<int, int>> pos(n);
    for (int i = 0; i < n; ++i) {
        pos[in[i].second].first = i;
        pos[out[i].second].second = i;
    }

    int res = 0;
    set<int> st;
    for (int i = 0, j = 0; i < n or j < n;) {
        if (in[i].first <= out[j].first) {
            int idx = in[i].second;
            st.insert(idx);
            i += 1;
        } else {
            int idx = out[j].second;
            if (in[pos[idx].first].first == out[j].first) {
                // 元々1個しか入ってない
                res += 1;
                st.clear();
            } else {
                // 2個以上入ってる
                if (st.find(idx) == st.end()) {
                    res += 2;
                } else {
                    res += 1;
                    st.clear();
                }
            }
            j += 1;
        }
    }
    cout << res << endl;
}