// bzoj2730#include<algorithm>#include<iostream>#include<cstdlib>#include<cstring>#include<cstdio>#include<cmath>#include<queue>#define LL long long#define inf 2147483640#define Pi acos(-1.0)#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);using namespace std;const int maxn=1010;struct edge {int to,next;}e[maxn<<1];int low[maxn],dfn[maxn],head[maxn],cut[maxn],vis[maxn],id[maxn],sum[maxn];int cnt,ind,m,n;void Init() {	cnt=ind=n=0;	memset(head,0,sizeof(head));	memset(vis,0,sizeof(vis));	memset(cut,0,sizeof(cut));	memset(dfn,0,sizeof(dfn));	memset(low,0,sizeof(low));	memset(sum,0,sizeof(sum));	memset(id,0,sizeof(id));}void link(int u,int v) {	e[++cnt].to=v;e[cnt].next=head[u];head[u]=cnt;	e[++cnt].to=u;e[cnt].next=head[v];head[v]=cnt;}void Tarjan(int x,int fa,int rt) {	int tot=0;	dfn[x]=low[x]=++ind;	for (int i=head[x];i;i=e[i].next) if (e[i].to!=fa) {			if (!dfn[e[i].to]) {				Tarjan(e[i].to,x,rt);				low[x]=min(low[x],low[e[i].to]);				if (low[e[i].to]>=dfn[x] && x!=rt) cut[x]=1;   //important				else if (x==rt) tot++;			}			else low[x]=min(low[x],dfn[e[i].to]);		}	if (tot>1) cut[x]=1;   //important}void dfs(int x,int col) {	vis[x]=cnt;	if (!id[x]) id[x]=col;	else id[x]=-1;	for (int i=head[x];i;i=e[i].next)		if (vis[e[i].to]!=cnt && !cut[e[i].to]) dfs(e[i].to,col);}int main() {	int T=0;	while (1) {		scanf("%d",&m);		if (m==0) break;		printf("Case %d: ",++T);		Init();		for (int u,v,i=1;i<=m;i++) {			scanf("%d%d",&u,&v);			link(u,v);n=max(n,max(u,v));		}		for (int i=1;i<=n;i++) if (!dfn[i]) Tarjan(i,0,i);		cnt=0;int col=0;		for (int i=1;i<=n;i++) if (cut[i]) {				cnt++;				for (int j=head[i];j;j=e[j].next)					if (vis[e[j].to]!=cnt && !cut[e[j].to]) dfs(e[j].to,++col);			}		for (int i=1;i<=n;i++) if (id[i]!=-1) sum[id[i]]++;		int tot=0;LL ans=1;		for (int i=1;i<=col;i++) if (sum[i]) tot++,ans=ans*sum[i];		if (!tot) printf("2 %d\n",n*(n-1)/2);		else printf("%d %lld\n",tot,ans);	}	return 0;}