#include<bits/stdc++.h>
#define Yzl unsigned long long
#define fi first
#define se second
#define pi pair<int,int>
#define mp make_pair
#define lob lower_bound
#define upb upper_bound
#define pb emplace_back
typedef long long LL;

using namespace std;

const Yzl Lty=20120712;

const int MAXN=5e5+10;
int n;
int len[MAXN],tot,lsh[MAXN],L[MAXN],R[MAXN],l[MAXN],r[MAXN];
vector<int> e[MAXN];
struct itv {
	int l,r;
}ind[MAXN]; int cnt,tp;
int main () { 
	scanf("%d",&n); int ans=0;
	for(int i=1;i<=n;++i) {
		scanf("%d",&len[i]); for(int j=1;j<=len[i];++j) { int x; scanf("%d",&x); e[i].pb(x); lsh[++tot]=x; }
	} sort(lsh+1,lsh+1+tot); tot=unique(lsh+1,lsh+1+tot)-lsh-1;
	for(int i=1;i<=n;++i) for(int j=0;j<len[i];++j) e[i][j]=lob(lsh+1,lsh+1+tot,e[i][j])-lsh;
	for(int i=1;i<=n;++i) { if(len[i]==1) { ++ans; continue; }
		sort(e[i].begin(),e[i].end()); ans+=2; 
		l[++tp]=e[i][0]; r[++tp]=e[i][len[i]-1];
	} sort(l+1,l+1+tp); sort(r+1,r+1+tp); r[tp+1]=Lty;
	for(int i=1;i<=n;++i) { if(len[i]==1) continue;
		L[i]=l[lob(l+1,l+1+tp,e[i][len[i]-1])-l-1];
		R[i]=r[upb(r+1,r+1+tp,e[i][0])-r];
		
		bool sf=0;
		for(int j=0;j<len[i];++j) {
			if(e[i][j]<=R[i]&&e[i][j]>=L[i]) sf=1;
		}
		if(sf) ind[++cnt]=(itv){e[i][0],e[i][len[i]-1]};
	} sort(ind+1,ind+1+cnt,[&](itv a,itv b){return a.l<b.l;});
	int lt=0;
	for(int i=1;i<=cnt;++i) {
		if(ind[i].l>lt) lt=ind[i].r,--ans;
		else lt=min(lt,ind[i].r);
	} printf("%d\n",ans);
	return 0;
}