rt.

#include<bits/stdc++.h>
using namespace std;
int n,sum,a[5005][5005],k[5005];
void dfs(int x)
{
	sum++;
	if(k[x]==0) return;
	for(int i=1;i<=k[x];i++)
	{
		dfs(a[x][i]);
	}
}
inline int read()
{
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')
		f=-1;
		ch=getchar();
	}
	while(ch>='0' && ch<='9')
	x=x*10+ch-'0',ch=getchar();
	return x*f;
}
int main()
{
	ios::sync_with_stdio(false);cin.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		k[i]=read();
		for(int j=1;j<=k[i];j++)
		a[i][j]=read();
	}
	dfs(1);
	cout<<sum;
	return 0;
}