#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define maxn 100020
#define maxe 1001000
using namespace std;
typedef long long LL;
LL Mod=1000000007;
struct Edge{
	int t,next;
}e[maxe];int len,head[maxn];
int n;
LL f[maxn];
void _addedge(int x,int y){
	len++;
	e[len].t=y;
	e[len].next=head[x];
	head[x]=len;
}
LL _dp(int x){
	if(x==0) return f[x]=1;
	if(f[x])return f[x];
	for(int i=head[x];i;i=e[i].next){
		int y=e[i].t;
		f[x]+=_dp(y);
	}
	return f[x];
}
int main(){
	freopen("three_squirrels.in","r",stdin);freopen("three_squirrels.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		int sz;scanf("%d",&sz);
		for(int j=1;j<=sz;j++){
			int x;scanf("%d",&x);
			_addedge(i,x);
		}
	}
	printf("%lld\n",_dp(n));
	getchar();getchar();
	return 0;
}