#include <bits/stdc++.h>
#define int long long

using namespace std;

int cnt, hs, he;
std::string s, st, et;

constexpr int a[] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};

int get_hash(std::string s) {
    int num1 = (s[0] - '0') * 10 + (s[1] - '0');
    int num2 = (s[3] - '0') * 10 + (s[4] - '0');
    int num3 = (s[6] - '0') * 10 + (s[7] - '0');

    return num1 * 60 * 60 + num2 * 60 + num3;
}

int turn(int ns) {
    return a[ns / 100] * (ns >= 100) + a[ns / 10 % 10] * (ns >= 10) + a[ns % 10];
}

void solve() {
    std::cin >> st;
    hs = get_hash(st);

    int ans = 0, s1 = 0, s2 = 0;
    int lst1 = hs, lst2 = hs;

    std::vector < std::pair <int, int> > vec;
    while(std::cin >> s) {
        if(s == "END") {
            break ;
        }

        std::string t;
        std::cin >> t;

        int num = get_hash(t);

        std::string team;
        std::cin >> team;

        int x;
        std::cin >> x;

        if(team == "home") {
            vec.push_back(std::make_pair(num - lst1, s1));
            lst1 = num;
            s1 += x;
        } else {
            vec.push_back(std::make_pair(num - lst2, s2));
            lst2 = num;
            s2 += x;
        }
    }

    cin >> et;
    he = get_hash(et);

    vec.push_back(std::make_pair(he - lst1, s1));
    vec.push_back(std::make_pair(he - lst2, s2));

    for(auto p : vec) {
        int tt = p.first;
        int ns = p.second;

        ans += tt * turn(ns);
    }

    std::cout << "Case " << cnt << ": " << ans << '\n';
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while(std::cin >> s) {
        cnt++;
        solve();
    }

    return 0;
}