UVA315

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

int n,m,cnt,num;
int head[105];
int dfn[105];
int low[105];
int res[105];
struct node{
	int v;
	int next;
}s[105*105];

void init()
{
	memset(head,-1,sizeof(head));
	memset(low,0,sizeof(low));
	memset(dfn,0,sizeof(dfn));
	memset(res,0,sizeof(res));
	cnt=num=0;
}
void add(int u,int v)
{
	s[cnt].v=v;
	s[cnt].next=head[u];
	head[u]=cnt++;
}
void tarjan(int u,int father)
{
	int son=0;
	dfn[u]=low[u]=++num;
	for(int i=head[u];i!=-1;i=s[i].next)
	{
		int v=s[i].v;
		if(!dfn[v])
		{
			son++;
			tarjan(v,u);	
			low[u]=min(low[u],low[v]);
			if(u==1&&son>1 || u!=1&&dfn[u]<=low[v])
				res[u]=1;
		}
		else if(v!=father)low[u] = min(low[u],dfn[v]); 
			
	}	
}
int main()
{
	while(~scanf("%d",&n) && n)//n个点 
	{
		init();
		while(scanf("%d",&m) &&m)//m都与谁连 ，0结束 
		{
			while(getchar()!='\n')//回车换一个m 
			{
				int u;
				scanf("%d",&u);
				add(m,u);
				add(u,m);
			 } 
		}
		tarjan(1,-1);
		int sum=0;
		for(int i=1;i<=n;i++)
			if(res[i])
				sum++;
		printf("%d\n",sum);
	}		
	return 0;
}