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

typedef pair<int,int> pi;
const int N=2e5+5;
int n;

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);if(l==r)sum++;else sum+=2;
	}
	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;
	for(int i=1;i<=n;i++)
		if(a[i].se<mn){
			mn=a[i].se;
			if(a[i].fi!=a[i].se)vs[i]=1;
		}
	int m=0;for(int i=1;i<=n;i++)if(vs[i])a[++m]=a[i];
	n=m;sort(a+1,a+n+1);
	for(int p=1;p<=n;){
		sum--;
		p=upper_bound(a+1,a+n+1,pi(a[p].se,0))-a;
	}
	printf("%d\n",sum);
}

}bool Med;int main(){
#ifdef LOCAL
	freopen("1.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;
}