//by emanlaicepsa
#include<bits/stdc++.h>
#define ll long long
#define int ll
#define IOS ios::sync_with_stdio(0),cin.tie(0);
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define all(n) (n).begin(),(n).end()
#define mem(n,k) memset(n,k,sizeof(n))
using namespace std;

bool in[2505][55];
ll dp[2505][55], cnt[2505];
vector<int> arr[55];

void solve(int n){
	mem(in,0);
	mem(dp,0x3f);
	mem(cnt,0);
	vector<int> tot;
	
	for(int i=1,x;i<=n;i++){
		cin>>x;
		arr[i].resize(x);
		for(int j=0;j<x;j++){
			cin>>arr[i][j];
			tot.pb(arr[i][j]);
		}
	}
	sort(all(tot));
	tot.resize(unique(all(tot))-tot.begin());
	
	for(int i=1;i<=n;i++){
		for(int j=0,x=arr[i].size();j<x;j++){
			arr[i][j] = lower_bound(all(tot),arr[i][j]) - tot.begin() + 1;
			in[arr[i][j]][i] = 1;
			//cout<<arr[i][j]<<" \n"[j==x-1];
		}
	}
	
	int siz = tot.size();
	
	
	
	for(int i=1;i<=siz;i++){
		for(int j=1;j<=n;j++){
			cnt[i] += in[i][j];
		}
	}
	
	for(int i=1;i<=n;i++){
		if(in[siz][i]) dp[siz][i] = cnt[siz];
	}
	//for(int i=1;i<=n;i++) cout<<dp[siz][i]<<" \n"[i==n];
	
	for(int i=siz-1;i>=1;i--){
		for(int j=1;j<=n;j++){
			if(!in[i][j]) continue;
			for(int k=1;k<=n;k++){
				if(dp[i+1][k] > 1e9) continue;
				dp[i][j] = min(dp[i][j],dp[i+1][k]+cnt[i]);
				if(in[i][k] && k!=j) dp[i][j] = min(dp[i][j],dp[i+1][k]+cnt[i]-1);
				if(cnt[i]==1 && k==j) dp[i][j] = min(dp[i][j],dp[i+1][k]);
			}
			//cout<<i<<" "<<j<<" "<<dp[i][j]<<'\n';
		}
	}
	ll ans = 1e18;
	for(int i=1;i<=n;i++){
		ans = min(ans,dp[1][i]);
	} 
	cout<<ans*2-n-1<<'\n';
}

signed main(){
	IOS;
	int cnt = 0, x;
	while(cin>>x){
		cout<<"Case "<<++cnt<<": ";
		solve(x);
	}
}