#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int N=1503;
int head[N],nxt[2*N],to[2*N],num;
void add(int x,int y){
	num++;
	to[num]=y;
	nxt[num]=head[x];
	head[x]=num;
}
int f[N][2];
void dfs(int x,int fa){
	f[x][0]=0;
	f[x][1]=1;
	for(int i=head[x];i;i=nxt[i]){
		if(fa==to[i]) continue;
		dfs(to[i],x);
		f[x][0]+=f[to[i]][1];
		f[x][1]+=min(f[to[i]][0],f[to[i]][1]);
	}
	if(f[x][0]>=0x3f3f3f3f-1) f[x][0]=0;
	if(f[x][1]>=0x3f3f3f3f-1) f[x][1]=1;
}
int main(){
	freopen("strategic.in","r",stdin);
	freopen("strategic.out","w",stdout);
	int n;
	while(cin>>n){
		num=0;
		memset(f,0x3f,sizeof(f));
		memset(head,0,sizeof(head));
		for(int i=1;i<=n;i++){
			int x,cnt,y;
			scanf("%d:(%d)",&x,&cnt) ;
			for(int j=1;j<=cnt;j++){
				cin>>y;
				add(x+1,y+1);
				add(y+1,x+1);
			}
		}
		dfs(1,0);
		cout<<min(f[1][0],f[1][1])<<endl;
	}
}