#include <iostream>
//#include <iomanip>
#include <algorithm>
#include <string>

using namespace std;
string n[10001][10001];
int main(){
	int a,b[10001],c[10001],d[10001],m[10001];
	cin>>a;
	for(int i=0;i<a;i++){
		cin>>n[i][10001]>>b[i]>>c[i]>>d[i];
		m[i]=b[i]+c[i]+d[i];
		
		for(int o=0;o<i;o++){
			if(m[i]<m[o]){
				swap(m[o],m[i]);
				swap(n[o],n[i]);
				swap(b[o],b[i]);
				swap(c[o],c[i]);
				swap(d[o],d[i]);
			}
		}
	}
	cout<<n[a-1][10001]<<" "<<b[a-1]<<" "<<c[a-1]<<" "<<d[a-1];
	
}
//1090k 364x=n
//x x+k,x+2k x+3k x+4k x+5k x+6k   52(21k+7x)=1456 
//21k+7x=119