#include<iostream>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
int n,ans=0,l[200010],r[200010],A[200010];
vector<int> a[200010],v;
inline bool cmp(const vector<int> &x,
const vector<int> &y)
{
	return x.back()<y.back();
}
int f[200010];
inline void add(int x,int y)
{
	for(;x<=n;f[x]=max(f[x],y),x+=x&-x);
}
inline int query(int x)
{
	int ret=0;
	for(;x;ret=max(ret,f[x]),x&=x-1);
	return ret;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n;
	for(int i=1,x;i<=n;i++)
	{
		cin>>x;
		a[i].resize(x);
		for(int j=0;j<x;j++)
		{
			cin>>a[i][j];
			v.emplace_back(a[i][j]);
		}
		sort(a[i].begin(),a[i].end());
		ans+=min(2,x);
	}
	sort(v.begin(),v.end());
	int num=unique(v.begin(),v.end())-v.begin();
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<a[i].size();j++)
		{
			a[i][j]=lower_bound(v.begin(),
			v.begin()+num,a[i][j])-v.begin()+1;
		}
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++)
	{
		int L=a[i][0];
		int R=A[i]=a[i].back();
		add(num-R+1,L);
		if(a[i].size()==1)
		{
			continue;
		}
		l[i]=query(num-L);
		r[i]=A[lower_bound(A+1,A+i+1,L)-A];
	}
	set<int> s;
	for(int i=n;i;i--)
	{
		if(a[i].size()==1)
		{
			continue;
		}
		s.insert(-a[i][0]);
		auto it=s.lower_bound(-a[i].back());
		l[i]=max(l[i],-(*it));
	}
	for(int i=1,last=0;i<=n;i++)
	{
		if(a[i].size()==1||l[i]>r[i])
		{
			continue;
		}
		if(last<a[i][0])
		{
			int p=lower_bound(a[i].begin(),
			a[i].end(),l[i])-a[i].begin();
			if(p==a[i].size()||a[i][p]>r[i])
			{
				continue;
			}
			last=a[i].back();
			ans--;
		}
	}
	cout<<ans<<endl;
	return 0;
}