#include <bits/stdc++.h>
using namespace std;
struct qwer {
	string m;
	int a, x, y, z;
} qq[1010];
int cmp(qwer x, qwer y) {
	return x.a > y.a;
}
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> qq[i].m;
		cin >> qq[i].x >> qq[i].y >> qq[i].z;
		qq[i].a = qq[i].x + qq[i].y + qq[i].z;
		/*if (qq[i].a > maxx) {
			maxx = qq[i].a;
			maxxn = qq[i].m;
			x1 = qq[i].x;
			x2 = qq[i].y;
			x3 = qq[i].z;
		}*/
	}
	sort(qq + 1, qq + n + 1, cmp);
	cout << qq[1].m << " " << qq[1].x << " " << qq[1].y << " " << qq[1].z;
	return 0;
}