#include <bits/stdc++.h>
using namespace std;
struct node {
	string name;
	int c,m,e,z;
} a[1001];
bool cmp(node a,node b) {
	if(a.z==b.z) return a.name>b.name;
	else return a.z>b.z;
}
int main() {
	int n;
	cin>>n;
	for(int i=1; i<=n; i++) {
		cin>>a[i].name>>a[i].c>>a[i].m>>a[i].e;
		a[i].z=a[i].c+a[i].m+a[i].e;
	}
	sort(a+1,a+n+1,cmp);
	cout<<a[1].name<<" "<<a[1].c<<" "<<a[1].m<<" "<<a[1].e;
}