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

const int N=5e5+1e3+7;

int n;

vector<int> L,R,v[N];

int qry(vector<int> &a,int l,int r)
{
    if(l>r)
        return 0;
    return upper_bound(a.begin(),a.end(),r)-lower_bound(a.begin(),a.end(),l);
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int k;
        cin>>k;
        v[i].resize(k);
        for(auto &x:v[i])
            cin>>x;
        L.push_back(*min_element(v[i].begin(),v[i].end()));
        R.push_back(*max_element(v[i].begin(),v[i].end()));
    }
    sort(L.begin(),L.end());
    sort(R.begin(),R.end());
    vector<pair<int,int> >segs;
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        sort(v[i].begin(),v[i].end());
        int ok=0;
        for(auto x:v[i])
        {
            int bad=0;
            {
                int s=v[i][0]+1,t=x;
                if(qry(R,s,t))
                    bad=1;
            }
            {
                int s=x,t=v[i].back()-1;
                if(qry(L,s,t))
                    bad=1;
            }
            ok|=!bad;
        }
        ans+=2;
        if(ok)
            segs.push_back({v[i].front(),v[i].back()});
    }
    sort(segs.begin(),segs.end(),[&](const auto &a,const auto &b) {
        return a.second<b.second;
    });
    int rp=-10;
    for(auto [l,r]:segs)
    {
        if(l<rp)
            continue;
        rp=r;
        ans--;
    }
    cout<<ans<<"\n";
}