rt

#include <bits/stdc++.h>
using namespace std;
struct node {
	int s,km;
	string name;
} a[10001];
bool cmp (node x,node y) {return x.km<y.km;}
string name="";
int ans=0x7f;
int main() {
	int n=0;
	while (1) {
		n++;
		cin>>a[n].s>>a[n].km>>a[n].name;
		if (a[n].km==0) break;
	}
	sort (a+1,a+n+1,cmp);
	for (int i=1;i<=n;i++) {
		int m=0;
		for (int j=1;j<=i-1;j++) m+=abs (a[i].km-a[j].km)*a[j].s;
		for (int j=i+1;j<=n;j++) m+=abs (a[j].km-a[i].km)*a[j].s;
		if (m<ans) {
			ans=m;
			name=a[i].name;
		}
	}
	cout<<name<<" "<<ans;
	return 0;
}