#include <algorithm>

#include <cassert>

#include <cmath>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <map>

#include <queue>

#include <set>

#include <string>

#include <tuple>

#define LOCAL_DEBUG

using namespace std;

typedef pair<int, int> MyPair;

const int MAXN = ;

const int MAXSTA =  << ;

int edges[MAXN][MAXN];

int edgeCnt[MAXN];

int vis[MAXN];

int vis2[MAXSTA];

int dp[MAXSTA];

int main() {

#ifdef LOCAL_DEBUG

    freopen("C:\\Users\\Iris\\source\\repos\\ACM\\ACM\\input.txt", "r", stdin);

    //freopen("C:\\Users\\Iris\\source\\repos\\ACM\\ACM\\output.txt", "w", stdout);

#endif // LOCAL_DEBUG

    int n;

    for (int ti = ; scanf("%d", &n) ==  && n; ti++) {

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

            scanf("%d", edgeCnt + i);

            for (int j = ; j < edgeCnt[i]; j++) {

                scanf("%d", edges[i] + j);

            }

        }

        int maxsta = ( << n) - ;

        for (int sta = ; sta <= maxsta; sta++) {

            memset(vis, , sizeof vis);

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

                if (sta & ( << i)) {

                    vis[i] = true;

                    for (int j = ; j < edgeCnt[i]; j++) {

                        vis[edges[i][j]] = true;

                    }

                }

            }

            bool fl = true;

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

                if (!vis[i]) {

                    fl = false;

                }

            }

            if (fl) {

                dp[sta] = ;

            }

            else {

                dp[sta] = ;

            }

        }

        for (int sta = ; sta <= maxsta; sta++) {

            for (int subSta = sta; subSta != ; subSta = (subSta - ) & sta) {

                dp[sta] = max(dp[sta], dp[sta ^ subSta] + dp[subSta]);

            }

        }

        printf("Case %d: %d\n", ti, dp[maxsta]);

    }

    return ;

}