#include<bits/stdc++.h>
using namespace std;bool Mbe;
namespace MAOJUN{

typedef pair<int,int> pi;
const int N=2e5+5;
int n,V=0,d[N*2],s[N*2];

pi a[N];bool vs[N];
#define fi first
#define se second
inline void main(){
	scanf("%d",&n);
	int sum=0;
	for(int i=1,k,x;i<=n;i++){
		scanf("%d",&k);
		int l=1e9,r=0;
		while(k--){scanf("%d",&x);l=min(l,x);r=max(r,x);}
		a[i]=pi(l,r);
		d[++V]=l;if(l!=r)d[++V]=r;
	}
	sum=V;
	sort(d+1,d+V+1);
	for(int i=1;i<=n;i++){
		a[i].fi=lower_bound(d+1,d+V+1,a[i].fi)-d;
		a[i].se=lower_bound(d+1,d+V+1,a[i].se)-d;
	}
	sort(a+1,a+n+1,[&](pi x,pi y){return x.fi^y.fi?x.fi>y.fi:x.se<y.se;});
	int mn=1e9+1,m=0;
	for(int i=1;i<=n;i++)
		if(a[i].se<mn){
			mn=a[i].se;
			if(a[i].fi!=a[i].se)a[++m]=a[i];
		}else{s[a[i].fi]++;s[a[i].se+1]--;}
	for(int i=1;i<=V;i++)s[i]+=s[i-1];
	n=m;sort(a+1,a+n+1);
	for(int i=1,j;i<=n;i=j+1){
		for(j=i;j<n&&a[j+1].fi<a[j].se;)j++;
		sum-=!s[a[i].fi]||!s[a[i].se];
	}
	printf("%d\n",sum);
}

}bool Med;int main(){
#ifdef LOCAL
	freopen("3.in","r",stdin);
	freopen("data.out","w",stdout);
	atexit([](){fprintf(stderr,"%dms\n%lfMB\n",clock(),(&Mbe-&Med)/1024./1024);});
#endif
	MAOJUN::main();
	return 0;
}