#include<stdio.h>

#include<string.h>

#include<stdlib.h>

#include<math.h>

#include<vector>

#include<iostream>

#include<algorithm>

#define MAXSIZE 1005

#define LL long long

using namespace std;

int vis[MAXSIZE],Map[MAXSIZE][MAXSIZE],low[MAXSIZE],dfn[MAXSIZE],pre[MAXSIZE],Time,n,ans,son;

void Tarjan(int u,int fa)

{

    pre[u]=fa;

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

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

    {

        if(!Map[u][i] || u==i) continue;

        if(!dfn[i])

        {

            Tarjan(i,u);

            low[u]=min(low[u],low[i]);

        }

        else if(fa!=i)

        {

            low[u]=min(low[u],dfn[i]);

        }

    }

}

void Init()

{

    memset(Map,,sizeof(Map));

    memset(low,,sizeof(low));

    memset(dfn,,sizeof(dfn));

    memset(vis,,sizeof(vis));

    memset(pre,,sizeof(pre));

    Time=;

    ans=;

    son=;

}

int main()

{

    int a,b;

    char ch,op;

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

    {

        Init();

        getchar();

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

        {

            while(scanf("%d%c",&b,&op))

            {

                Map[a][b]=Map[b][a]=;

                if(op=='\n') break;

            }

        }

        Tarjan(,);

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

        {

            if(pre[i]==)

                son++;

            else if(dfn[pre[i]] <= low[i])

                vis[pre[i]]=;

        }

        if(son > ) ans++;

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

            if(vis[i]) ans++;

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

    }

    return ;

}