#include<bits/stdc++.h>
using namespace std;
struct node
{
	string name;
	int yu,shu,ying,zong;
};
bool cmp(node q,node h)
{
	if(q.zong>=h.zong) return q.zong<h.zong;
	else return h.zong<q.zong;
}
node a[1005];
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].name>>a[i].yu>>a[i].shu>>a[i].ying;
		a[i].zong=a[i].yu+a[i].shu+a[i].ying;
	}
	sort(a+1,a+1+n,cmp);
	cout<<a[1].name<<" "<<a[1].yu<<" "<<a[1].shu<<" "<<a[1].ying<<" "; 
	return 0;
}