#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

int id ;

void solve ( ) {
    int q ; cin >> q ;
    string a ;
    ll ans = 0 ;
    ++ q ;
    ++ id ;
    while ( q -- ) {
        getline ( cin , a ) ;
        int sz = a.size ( ) ;
        ll coef = 0 ;
        if ( a[ 0 ] == 'b' ) { coef = 1 ; } // bool
        if ( a[ 0 ] == 'c' ) { coef = 1 ; } // char
        if ( a[ 0 ] == 'i' ) { coef = 4 ; } // int
        if ( a[ 0 ] == 'l' && a[ 5 ] == 'l' ) { coef = 8 ; } // long long
        if ( a[ 0 ] == '_' ) { coef = 16 ; } // __int128
        if ( a[ 0 ] == 'f' ) { coef = 4 ; }
        if ( a[ 0 ] == 'd' ) { coef = 8 ; }
        if ( a[ 0 ] == 'l' && a[ 5 ] == 'd' ) { coef = 16 ; }
        ll hh = 1 ;
        ll nw = 0 ;
        bool fl = false ;
        for ( int i = 0 ; i < sz ; ++ i ) {
            if ( a[ i ] == '[' ) { fl = true ; }
            if ( a[ i ] == ']' ) { break ; }
            if ( fl == true && a[ i ] != '[' ) {
                nw = ( nw * 10 + ( a[ i ] - '0' ) ) ;
            }
        }
        if ( fl == true ) { hh = nw ; }
        ans += coef * hh ;
    }
    cout << "Case #" << id << ": " << ( ans + 999 ) / 1000 << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}