#include <stdio.h>

 #include <stack>

 #include <string.h>

 #define maxn 505

 using namespace std;

 stack <int >s;

 int head[maxn],n,pos,dfn[maxn],low[maxn],bcnt,dindex,num[maxn],root;

 bool vis[maxn];

 struct node{

     int next,to;

 }edge[maxn];

 void add(int u,int v)

 {

     edge[pos].to = v;

     edge[pos].next = head[u];

     head[u] = pos++;

 }

 void Tarjan(int u)

 {

     dfn[u] = low[u] = ++dindex;

     vis[u] = true;

     s.push(u);

     for(int i = head[u]; i != - ; i = edge[i].next)

     {

         int v = edge[i].to;

         if(!vis[v])

         {

             Tarjan(v);

             if(low[v]<low[u]) low[u] = low[v];

             if(low[v]>=dfn[u]&&u!=)

             {

                 num[u]++;

             }else if(u==)

                 root++;

         }else if(dfn[v]<low[u])

             low[u] = dfn[v];

     }

 }

 int main()

 {

     int u,v,ans;

   //  freopen("in.txt","r",stdin);

     while(scanf("%d",&n),n)

     {

         memset(head,-,sizeof(head));

         memset(vis,false,sizeof(vis));

         memset(dfn,,sizeof(dfn));

         memset(low,,sizeof(low));

         memset(num,,sizeof(num));

         pos = ;

         ans = ;

         while(scanf("%d",&u)&&u)

         {

             while(getchar()!='\n')

             {

                 scanf("%d",&v);

                 add(u,v);

                 add(v,u);

             }

         }

         bcnt = dindex = root=;

         for(int i = ;i<=n;i++)

             if(!dfn[i]) Tarjan(i);

         for(int i =  ; i<=n;i++)

             if(num[i]) ans++;

         if(root>) ans++;

         printf("%d\n",ans);

     }

     return ;

 }