#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>

#define INF (1<<30)
#define mod 666013

using namespace std;
int x, n, mem, nr, b, i;
char s[105];
int main()
{
    //freopen("1.in", "r", stdin);
    //freopen("1.out", "w", stdout);
    gets(s+1);
    while(!feof(stdin))
    {
        i=1;
        mem=0;
        n=strlen(s+1);
        if(s[1]=='u')
            i+=9;
        if(s[i]=='i')
        {
            b=4;
            i+=4;
        }
        else if(s[i]=='c')
        {
            b=1;
            i+=5;
        }
        else if(s[i]=='s')
        {
            b=2;
            i+=6;
        }
        x=1;
        nr=-1;
        while(i<=n)
        {
            if((s[i]>='a'&&s[i]<='z')||(s[i]>='A'&&s[i]<='Z'));
            else if(s[i]=='[')
                nr=0;
            else if(nr>=0&&s[i]>='0'&&s[i]<='9')
                nr=nr*10+s[i]-'0';
            else if(s[i]==']')
                x=x*nr, nr=-1;
            else if(s[i]==',')
                mem+=x, x=1;
            i++;
        }
        mem+=x;
        printf("%d\n", mem*b);
        gets(s+1);
    }
    return 0;
}