#include<bits/stdc++.h>
using namespace std;

#define V vector
#define pb push_back
#define fi first
#define se second
#define all0(x) (x).begin(), (x).end()
#define all1(x) (x).begin() + 1, (x).end()

typedef long long LL;
typedef pair<int, int> pi;

void solve(){
    int n; cin >> n;
    V<V<int>> a(n + 1);
    for(int i = 1; i <= n; i++) {
        int k; cin >> k;
        a[i].resize(k);
        for(int j = 0; j < k; j++) cin >> a[i][j];
        sort(all0(a[i]));
    }
    V<int> l(n + 1), r(n + 1);
    for(int i = 1; i <= n; i++) {
        l[i] = *min_element(all0(a[i]));
        r[i] = *max_element(all0(a[i]));
    }
    V<int> lmax(n + 1), rmin(n + 1);
    V<int> ord(n + 1);
    iota(all1(ord), 1);
    set<int> st;
    sort(all1(ord), [&](int x, int y) {
        return l[x] < l[y];
    });
    for(int i = 1; i <= n; i++) {
        int x = ord[i];
        while(st.size() && *st.begin() < l[x]) st.erase(st.begin());
        if(st.size()) {
            rmin[x] = *st.begin();
        } else {
            rmin[x] = 2e9;
        }
        st.insert(r[x]);
    }
    st.clear();
    sort(all1(ord), [&](int x, int y) {
        return r[x] > r[y];
    });
    for(int i = 1; i <= n; i++) {
        int x = ord[i];
        while(st.size() && *st.rbegin() > r[x]) st.erase(st.begin());
        if(st.size()) {
            lmax[x] = *st.rbegin();
        } else {
            lmax[x] = 0;
        }
        st.insert(l[x]);
    }
    // for(int i = 1; i <= n; i++) cout << lmax[i] << " " << rmin[i] << "\n";
    V<pi> item;
    for(int i = 1; i <= n; i++) {
        auto it = lower_bound(all0(a[i]), lmax[i]);
        while(it != a[i].end() && *it <= rmin[i]) {
            item.pb({*it, r[i]});
            it++;
        }
    }
    sort(all0(item));
    item.pb({2e9, 0});
    // for(auto [x, y] : item) cout << x << " " << y << "\n";
    V<int> dp(item.size());
    for(int i = 0; i + 1 < item.size(); i++) {
        dp[i + 1] = max(dp[i], dp[i + 1]);
        dp[lower_bound(all0(item), pi{item[i].se + 1, 0}) - item.begin()]
        = max(dp[lower_bound(all0(item), pi{item[i].se + 1, 0}) - item.begin()], dp[i] + 1);
    }
    cout << 2 * n - dp.back() << "\n";

}
int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    // int t; cin >> t;
    // while(t--) 
        solve();
}