#include <iostream>
#include <cmath>
#include <string>
#include <algorithm> 
using namespace std;

struct Stu
{
    int num, l;
    string name;
}p[210];

bool cmp(Stu x, Stu y)
{
    return x.l < y.l;
}

int main()
{
    int n = 0;
    while (true)
    {
        cin >> p[++n].num >> p[n].l >> p[n].name;
        if (p[n].name == "Moscow")
        {
            break;
        }
    }
    sort(p + 1, p + n + 1, cmp);
    int minn = 1e9;
    for (int i = 1; i <= n; i++)
    {
        int sum = 0;
        for (int j = 1; j <= n; j++)
        {
            if (i == j) continue;
            sum += p[j].num * (p[i].l - p[j].l);
        }
        minn = min(minn, sum);
    }
    cout << minn << endl;
    return 0;
}