#include 
     
      #include 
      
       #include 
       
        #include 
        
         using namespace std;const int maxn=20;int g[maxn][maxn];int vis[maxn];int n,cnt;int cacl(int x){    return x==0?0:(cacl(x/2)+(x&1));}bool two(int x)//判断是否超过两个联通分量{    for(int i=0;i
         
          2) return 1;    }    return 0;}bool dfs(int x,int u,int fa){    vis[u]=1;    for(int i=0;i
          
           =cnt-1)//打开的环如果比不打开的环个数减一还要大，那么就能连成链 ans=min(ans,mm); } return ans;}int main(){ int Case=0; while(~scanf("%d",&n)&&n) { memset(g,0,sizeof(g)); int a,b; while(~scanf("%d%d",&a,&b)) { if(a==-1&&b==-1) break; g[a-1][b-1]=g[b-1][a-1]=1; } printf("Set %d: Minimum links to open is %d\n",++Case,solved()); } return 0;}