#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <algorithm>

#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
using namespace std;

const int INF = 0x3f3f3f3f;
const double EPS = 1e-11;
const double PI = 3.141592653589793;
const int MAX_N = 300005;
const long long LLINF = 99999999999999999LL;
const int SIGMA = 26;

int N, M;
char s[MAX_N];

int main() {
    /*
    #ifndef ONLINE_JUDGE
        freopen("data.in", "r", stdin);
    #endif
    */

    while(cin.get(s, 105)) {
        cin.get();

        int len = strlen(s), p = 0;
        long long ans = 0, cost = 0;

        if(s[p] == 'u') {
            while(s[p] != ' ')
                ++p;
            ++p;
        }

        if(s[p] == 'c')
            cost = 1;
        else if(s[p] == 's')
            cost = 2;
        else if(s[p] == 'i')
            cost = 4;

        while(s[p] != ' ')
            ++p;
        ++p;

        while(p < len) {
            while(p < len && s[p] != ',' && s[p] != '[')
                ++p;
            long long now = 1;
            while(p < len && s[p] == '[') {
                long long val = 0;

                ++p;
                while(s[p] != ']') {
                    val = val * 10 + s[p] - '0';
                    ++p;
                }
                ++p;
                now *= val;
            }
            ans += now * cost;

            while(p < len && s[p] == ',')
                ++p;
        }

        printf("%lld\n", ans);
    }

    return 0;
}