#include<stdio.h>

#include<string.h>

#include<algorithm>

#define MAXN 100010

#define MAXM 100010

#pragma comment(linker, "/STACK:102400000,102400000")

typedef long long LL;

int dfn[MAXN], low[MAXN], h[MAXN], ind;

bool vis[MAXN];

int N, M, first[MAXN], e, next[MAXM], v[MAXM], col[MAXN];

struct Edge

{

    int x, y;

}edge[MAXM];

void dfs(int u, int p, int o)

{

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

    int cnt = ;

    for(int i = first[u]; i != -; i = next[i])

    {

        if(v[i] == p) continue;

        if(!dfn[v[i]])

        {

            ++ cnt;

            dfs(v[i], u, o);

            low[u] = std::min(low[u], low[v[i]]);

            if(u == o && cnt > ) h[u] = ;

            else if(u != o && low[v[i]] >= dfn[u]) h[u] = ;

        }

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

    }

}

void tarjan()

{

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

        low[i] = dfn[i] = h[i] = ;

    ind = ;

    dfs(i, -, i);

}

void add(int x, int y)

{

    v[e] = y;

    next[e] = first[x], first[x] = e ++;

}

void input()

{

    N = ;

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

    {

        scanf("%d%d", &edge[i].x, &edge[i].y);

        N = std::max(edge[i].x, N);

        N = std::max(edge[i].y, N);

    }

    memset(first, -, sizeof(first[]) * (N + )), e = ;

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

        add(edge[i].x, edge[i].y), add(edge[i].y, edge[i].x);

}

void find(int x, int c, int &pn, int &cn)

{

    vis[x] = true, ++ pn;

    for(int i = first[x]; i != -; i = next[i])

    {

        int y = v[i];

        if(vis[y]) continue;

        if(h[y])

        {

            if(col[y] != c) col[y] = c, ++ cn;

            continue;

        }

        find(y, c, pn, cn);

    }

}

void process()

{

    tarjan();

    memset(vis, , sizeof(vis[]) * (N + ));

    memset(col, , sizeof(col[]) * (N + ));

    LL ans = ;

    int cnt = ;

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

        if(!h[i] && !vis[i])

        {

            int pn = , cn = ;

            find(i, i, pn, cn);

            if(cn == ) ans *= (LL)pn * (pn - ) / , cnt += ;

            else if(cn == ) ans *= pn, ++ cnt;

        }

    printf("%d %I64d\n", cnt, ans);

}

int main()

{

    int t = ;

    while(scanf("%d", &M), M > )

    {

        input();

        printf("Case %d: ", ++ t);

        process();

    }

    return ;

}