//poj1523

 #include <cstdio>

 #include <cstring>

 #include <iostream>

 using namespace std ;

 int edge[][],dfn[],low[],subnet[] ;

 int tot,Node ,son;

 void dfs(int u)

 {

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

     for(int v =  ; v <= Node ; v++)

     {

         if(edge[u][v])

         {

             if(!dfn[v])

             {

                 dfs(v) ;

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

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

                 {

                     if(u != )//非根节点

                         subnet[u] ++ ;

                     else son ++ ;

                 }

             }

             else

             {

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

             }

         }

     }

 }

 void Init()

 {

     tot = son = Node = ;

     memset(dfn,,sizeof(dfn)) ;

     memset(low,,sizeof(low)) ;

     memset(subnet,,sizeof(subnet)) ;

     memset(edge,,sizeof(edge)) ;

 }

 int main()

 {

     int m,n ;

     int casee =  ;

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

     {

         scanf("%d",&n) ;

         Init() ;

         Node = max(m,max(n,Node)) ;

         edge[m][n] = edge[n][m] =  ;

         while(~scanf("%d",&m) && m)

         {

             scanf("%d",&n) ;

             Node = max(m,max(n,Node)) ;

             edge[m][n] = edge[n][m] =  ;

         }

 //        if(casee > 1)

 //            puts("") ;

         printf("Network #%d\n",casee ++) ;

         dfs() ;

         if(son > )

             subnet[] = son -  ;

         int flag =  ;

         for(int i =  ; i <= Node ; i++){

             if(subnet[i])

             {

                 flag =  ;

                 printf("  SPF node %d leaves %d subnets\n",i,subnet[i]+) ;

             }

         }

         if(!flag)

             puts("  No SPF nodes") ;

         puts("") ;

     }

     return  ;

 }