#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

map<string, int> sz;

int testcase;

inline void input(string &s) {
    s = "";
    char c = getchar();
    bool start = false;
    while (c != ';') {
        if (start) s += c;
        else if (isalpha(c) || c == '_') {start = true; s += c;}
        c = getchar();
    }
}

inline void work() {
    int n = rd();
    ll ans = 0;
    string s;
    rep(i, 1, n) {
        input(s);
        string type = "", element = "";
        bool space = false;
        per(i, s.length(), 0) {
            if (s[i] == ' ' && !space) {space = true; continue;}
            space ? type += s[i] : element += s[i];
        }
        reverse(all(type));
        reverse(all(element));
        int amount = 0;
        for (auto c : element) {
            if (!isdigit(c)) continue;
            amount = amount * 10 + (c - '0');
        }
        if (!amount) amount = 1;
        ans += 1ll * sz[type] * amount;
    }
    printf("Case #%d: %lld\n", ++testcase, (ans + 1023) / 1024);
}

int main() {
    sz["bool"] = sz["char"] = 1;
    sz["int"] = sz["float"] = 4;
    sz["long long"] = sz["double"] = 8;
    sz["__int128"] = sz["long double"] = 16;
    per(t, rd(), 1) work();
    return 0;
}