#include<cstdio>
#include <vector>
#include <string>
#include <string.h>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1000+5;
struct node
{
	string name;
	int id;
	double y;//语文
	double s;//数学
	double e;//英语
	double sum;
}stu[maxn];
bool cmp(struct node a,struct node b)
{
	if(a.sum!=b.sum )
		return a.sum >b.sum ;
	else if(a.y!=b.y)
		return a.y>b.y;
	else if(a.s!=b.s)
		return a.s>b.s;
	else if(a.e!=b.e)
		return a.e>b.e;
	else
		return a.id<b.id;
}
int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>stu[i].name >>stu[i].y >>stu[i].s >>stu[i].e ;
		stu[i].sum=stu[i].y+stu[i].s+stu[i].e;
		stu[i].id=i;
	}
	sort(stu,stu+n,cmp);
	for(int i=0;i<n;i++)
		cout<<stu[i].name <<" "<<stu[i].y<<" "<<stu[i].s<<" "<<stu[i].e<<endl;
	//system("pause");
	return 0;
}