#include<algorithm>
using namespace std;
struct node {
	int hm,km;
	int s;
	string cn;
} a[155];
int main() {
	int n=1;
	while(a[n-1].cn!="Moscow") {
		cin>>a[n].hm>>a[n].km>>a[n].cn;
		n++;
	}
	for(int i=1; i<=n; i++) {
		a[i].s==0;
		for(int j=1; j<=n; j++) {
			a[i].s+=a[j].hm*abs((a[j].km-a[i].km));
		}
	}
	for(int i=2; i<=n; i++) {
		if(a[i].s>a[i-1].s) {
			int x=a[i-1].s;
			a[i-1].s=a[i].s;
			a[i].s=x;
			string y=a[i].cn;
			a[i].cn=a[i-1].cn;
			a[i-1].cn=y;
		} else if(a[i].s==a[i-1].s) {
			if(a[i].km<a[i-1].km) {
				int x=a[i-1].s;
				a[i-1].s=a[i].s;
				a[i].s=x;
				string y=a[i].cn;
				a[i].cn=a[i-1].cn;
				a[i-1].cn=y;
			}
		}
	}
	cout<<a[1].cn<<" "<<a[1].s;
	return 0;
}```