#include<iostream>
#include<cstdio>
using namespace std;
long long n,sum=0,k,ans=0;
long long Bag[100010][20],a[20],b[20];
const int MAXN=1000000007;
int dfs(int n)
{
	if(b[n]!=0) return b[n];
	for(int i=1;i<=a[n];i++)
	{
		sum+=dfs(Bag[n][i]);
		b[n]+=sum;
		sum=0;
	}
	return b[n];
}
void init()
{
	scanf("%d",&n);
	b[0]=1;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		for(int j=1;j<=a[i];j++)
			cin>>Bag[i][j];
	}
}
int main()
{
	freopen("three_squirrels.in","r",stdin);
	freopen("three_squirrels.out","w",stdout);
	init();
	dfs(n);
	cout<<b[n];
	return 0;
}