//Date: 2024-11-23 14:40:13
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int rd() {
    int s=0,m=0;char ch=getchar();
    while(!isdigit(ch)) {if(ch=='-')m=1;ch=getchar();}
    while( isdigit(ch)) s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
    return m?-s:s;
}
bool MBE;
namespace SOLVER {
int n,cnt,f[200005],g[200005];struct QWQ {int l,r;} a[200005],b[200005];
bool cmp(QWQ a1,QWQ a2) {return a1.r!=a2.r?a1.r<a2.r:a1.l<a2.l;}
void MAIN() {
    cin>>n;
    for(int i=1;i<=n;i++) {
        int len=rd();a[i].l=1e9+1,a[i].r=0;
        for(int j=1,x;j<=len;j++) x=rd(),a[i].l=min(a[i].l,x),a[i].r=max(a[i].r,x);
    }
    sort(a+1,a+n+1,cmp);int Mx=0;
    for(int i=1;i<=n;i++) {
        if(a[i].l>Mx) b[++cnt]=a[i];
        Mx=max(Mx,a[i].l);
    }
    int las=0,ans=0;
    for(int i=1;i<=n;i++) if(b[i].l>b[las].r) las=i,ans++;
    cout<<2*n-ans<<endl;
}
}
bool MED;
signed main() {
    //freopen(".in","r",stdin);freopen(".out","w",stdout);
    for(int tt=1;tt;tt--) SOLVER::MAIN();
    cerr<<(&MBE-&MED)/1024<<" KB, "<<1000*clock()/CLOCKS_PER_SEC<<" ms\n";
    return 0;
}