#include <iostream>
#include <cstring>
#include <deque>

using namespace std;

deque < int > sol;
string s;

void solve(int &poz, int &var){
    int doch = 1;
    while(poz < s.size() && s[poz] == '['){
        int nr = 0;
        poz++;
        while(s[poz] >= '0' && s[poz] <= '9'){
            nr = nr * 10 + (s[poz] - '0');
            poz++;
        }
        doch *= nr;
        poz++;
    }
    var += doch;
}

int main()
{
    string in("int");
    string sh("short");
    string ch("char");
    bool go = false;
    int byte,nrvar;
    char lc = 'a';
    while(cin >> s){
        nrvar = 0;
        if(go == false){
            if(s.compare(in) == 0 || s.compare(sh) == 0 || s.compare(ch) == 0){
                if(s.compare(in) == 0){
                    byte = 4;
                }
                if(s.compare(sh) == 0){
                    byte = 2;
                }
                if(s.compare(ch) == 0){
                    byte = 1;
                }
                go = true;
            }
        } else {
            go = false;
            for(int i = 0; i < s.size(); i++){
                if(s[i] == ',' && lc != ']'){
                    nrvar++;
                }
                lc = s[i];
                if(s[i] == '['){
                    solve(i,nrvar);
                }
            }
            sol.push_back(nrvar * byte);
        }
    }
    for(int i = 0; i < sol.size(); i++){
        cout << sol[i] << "\n";
    }
    return 0;
}