#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;

const int maxn=100001;
const int Mod=1000000007;

int n,dp[maxn],ary[maxn][15];
bool vis[maxn];

int dfs(int x)
{
	if(vis[x]) return dp[x];
	vis[x]=1;
	for(int i=1;i<=ary[x][0];++i)
	{
		dp[x]+=dfs(ary[x][i]);
	}
	return dp[x];
}

int main()
{
	freopen("three_squirrels.in","r",stdin);
	freopen("three_squirrels.out","w",stdout);
	
	scanf("%d",&n);dp[0]=1;vis[0]=1;
	for(int i=1;i<=n;++i)
	{
		scanf("%d",ary+i);
		for(int j=1;j<=ary[i][0];++j) scanf("%d",ary[i]+j);
	}
	printf("%d",dfs(n));
	
	return 0;
}