#include<algorithm>

 #include<cstdio>

 #define reset(a) std::fill(a,a+1+n,0)

 #define min(a,b) ((a)<(b)?(a):(b))

 #define max(a,b) ((a)>(b)?(a):(b))

 #define N 50020

 int n,m,dfn[N],low[N],vis[N],tot,k,T;

 const int ch_top=4e7+;

 char ch[ch_top],*now_r=ch-,*now_w=ch-;

 inline int read(){

     while(*++now_r<'');

     register int x=*now_r-'';

     while(*++now_r>='')x=x*+*now_r-'';

     return x;

 }

 long long ans;

 bool gd[N];

 int Head[N],to[N<<],next[N<<],num;

 void Tarjan(int u){

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

     int cnt=;

     for(int i=Head[u];i;i=next[i]){

         int v=to[i];

         if(!dfn[v]){

             Tarjan(v); cnt++;

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

             if((u==&&cnt>)||(u!=&&low[v]>=dfn[u]))

              gd[u]=;

         }

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

     }

 }

 int dfs(int t){

     int sz=; vis[t]=;

     for(int i=Head[t];i;i=next[i])

      if(!vis[to[i]]&&!gd[to[i]])

          sz+=dfs(to[i]);

      else if(vis[to[i]]!=T&&gd[to[i]]){

          k++; vis[to[i]]=T;

      }

     return sz;

 }

 int main()

 {

     fread(ch,,ch_top,stdin);

     int now=;

     m=read();

     while(m){

         if(!m) break;

         reset(Head); reset(gd);

         reset(vis); reset(dfn);

         num=tot=n=T=;

         int x,y;

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

             x=read(); y=read();

             to[++num]=y;

             next[num]=Head[x];

             Head[x]=num;

             to[++num]=x;

             next[num]=Head[y];

             Head[y]=num;

             n=max(n,max(x,y));

         }

         int cnt=;

         Tarjan();ans=;

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

          if(!gd[i]&&!vis[i]){

              k=; T++;

              int size=dfs(i);

              if(k==) ans*=(long long)size*(size-)/,cnt+=;

              else if(k==) ans*=size,cnt++;

          }

         printf("Case %d: %d %lld\n",++now,cnt,ans);

         m=read();

     }

     return ;

 }