9
1  3
4  1
3  5
1  2
2  6
1  5
6  3
1  6
3  2
6
1  2
1  3
2  4
2  5
3  6
3  7
0

Case 1: 2 4
Case 2: 4 1

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define N 11000
using namespace std;
bool vis[N],cut_point[N];
int n,m,tot,tim,sum,cnt,top,ans1,ans2;
int x[N],y[N],dfn[N],low[N],ans[N],head[N],stack[N],belong[N];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}return x*f;
}
struct Edge
{int from,to,next;
}edge[N];
int add(int x,int y)
{tot++;edge[tot].to=y;edge[tot].next=head[x];head[x]=tot;
}
int tarjan(int x,int pre)
{int s=0; bool boo;dfn[x]=low[x]=++tim;vis[x]=true;for(int i=head[x];i;i=edge[i].next){int t=edge[i].to;if((1^i)==pre) continue;if(!vis[t]){s++;tarjan(t,i);low[x]=min(low[t],low[x]);if(low[t]>=dfn[x]) boo=true;  }else low[x]=min(low[x],dfn[t]);}if(!pre) {if(s>1) cut_point[x]=true;}else {if(boo) cut_point[x]=true;}
}
int tarjan1(int now)
{dfn[now]=low[now]=++tim;stack[++top]=now;vis[now]=true;for(int i=head[now];i;i=edge[i].next){int t=edge[i].to;if(vis[t]) low[now]=min(low[now],dfn[t]);else if(!dfn[t]) tarjan1(t),low[now]=min(low[now],low[t]);}if(dfn[now]==low[now]){sum++; belong[now]=sum;ans[sum]++;for(;stack[top]!=now;top--)belong[stack[top]]=sum,vis[stack[top]]=false,ans[sum]++;vis[now]=false; top--;}
}
int begin()
{tot=0,tim=0,sum=0,ans2=1;memset(ans,0,sizeof(ans));memset(dfn,0,sizeof(dfn));memset(low,0,sizeof(low));memset(vis,0,sizeof(vis));memset(head,0,sizeof(head));memset(belong,0,sizeof(belong));
}
int main()
{while(1){m=read();if(m==0) break;begin();cnt++,tot=1;memset(cut_point,0,sizeof(cut_point));for(int i=1;i<=m;i++)x[i]=read(),y[i]=read(),add(x[i],y[i]),add(y[i],x[i]);    tarjan(1,0); begin();for(int i=1;i<=m;i++){n=max(max(x[i],y[i]),n);if(cut_point[x[i]]||cut_point[y[i]]) continue;add(x[i],y[i]),add(y[i],x[i]); }for(int i=1;i<=n;i++)if(!dfn[i]&&!cut_point[i]) tarjan1(i);ans1=sum;for(int i=1;i<=sum;i++)ans2*=ans[i];printf("Case %d: %d %d\n",cnt,ans1,ans2);}return 0;
}