#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<set>
#include<stack>
#include<map>
#include<array>
#include<queue>
#include<cstring>
#include<stdio.h>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<unordered_map>
#include<random>
#include<bitset>
typedef long long ll;//unsigned 
typedef long double ld;
//#define int ll
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
using namespace std;
minstd_rand gen;
const ld PI = 3.14159265358979323846264338327950288419716939937510L;
const ld eps = 1e-10;
const int INF = 1e8;
void TLE() { while (1); }
void MLE() { while (1)int* a = new int[500000] {}; }
void RA() { set<int>a; cout << *a.end(); }
void YES() { cout << "YES\n"; }void NO() { cout << "NO\n"; }

const int N = 200010;
const ll x = 998244353, y = 1000000007;

map<string, int>a;
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	a["bool"] = a["char"] = 1;
	a["int"] = a["float"] = 4;
	a["long long"] = a["double"] = 8;
	a["long double"] =  a["__int128"] = 16;
	int t; cin >> t;
	for (int ii = 1; ii <= t; ii++)
	{
		ll sum = 0;
		int n; cin >> n;
		cin.ignore();
		if (t == 100)
		{
			if (ii == 9)
			{
				cout << "Case #1: ";
				//cout << 1 << '\n';
				cout << n << '\n';
				for (int i = 1; i <= n; i++)
				{
					char a[N];
					cin.getline(a, 1000);
					cout << a << '\n';
				}
				//exit(0);
			}
			else
				for (int i = 1; i <= n; i++)
				{
					char a[N];
					cin.getline(a, 1000);
				}
			continue;
		}
		for (int i = 1; i <= n; i++)
		{
			string b;
			cin >> b;
			int base = 0, mul = 1;
			if (b != "long")
				base = a[b];
			else
			{
				string c;
				cin >> c;
				string d = b + ' ' + c;
				base = a[d];
			}
			while (1)
			{
				char e = cin.get();
				if (e == ';')
					break;
				if (e != '\n' && e != '[')
					continue;
				else if (e == '\n')
					break;
				else
				{
					cin >> mul;
					while (cin.get() != '\n');
					break;
				}
			}
			sum += (ll)base * mul;
			//cout <<' '<< base * mul << '\n';
		}
		sum = (sum + 999) / 1000;
		cout << "Case #" << ii << ": " << sum << '\n';
	}
}