#include<stdio.h>
#include<algorithm>
struct person
{
	char name[64]; int t, f, n, total;
	friend bool operator < (person p1, person p2)
	{
		if(p1.total!=p2.total) return p1.total<p2.total;
		if(p1.n!=p2.n) return p1.n<p2.n;
		if(p1.f!=p2.f) return p1.f<p2.f;
		return p1.t<p2.t;
	}
};
using namespace std;
int n;
person a[128];
int main()
{
	int i;
	scanf("%d", &n);
	for(i=1;i<=n;i++)
	{
		scanf("%s%d%d%d", a[i].name, &a[i].t, &a[i].f, &a[i].n);
		a[i].total=a[i].t*2+a[i].f*5+a[i].n*9;
	}
	sort(&a[1], &a[n+1]);
	for(i=n;i>=1;i--) printf("%s\n", a[i].name);
	return 0;
}