#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

using namespace std;

ll cnt, i, n, nr, S, sol;
char s[105];

int main()
{
    //    freopen("test.in", "r", stdin);
//    freopen("test.out", "w", stdout);

    while(1)
    {
        sol = 0;
        memset(s, 0, sizeof(s));
        fgets(s, 105, stdin);
        n = strlen(s);
        if(n == 0) break;
        i = 0;
        if(s[i] == 'u') i = 9;

        if(s[i] == 'c')
        {
            cnt = 1;
            i += 5;
        }
        else if(s[i] == 's')
        {
            cnt = 2;
            i += 6;
        }
        else if(s[i] == 'i')
        {
            cnt = 4;
            i += 4;
        }

        for(; i < n; i++)
        {
            if(s[i] == ' ') continue;

            while(s[i] >= 'a' && s[i] <= 'z') i++;

            S = 1;
            if(s[i] == '[')
            {
                while(s[i] == '[')
                {
                    i++;
                    nr = 0;
                    while(s[i] >= '0' && s[i] <= '9')
                        nr = nr * 10 + s[i] - '0', i++;
                    i++;
                    S *= nr;
                }
            }

            sol += S * cnt;
        }

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

    return 0;
}