#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
struct stu
{
    string name;
    int c=-1;
    int m=-1;
    int e=-1;
    int count=-1;
} num[1005];
int n;
int cmp(stu a, stu b)
{

    return a.count <= b.count;
}

int main(int argc, char const *argv[])
{
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> num[i].name >> num[i].c >> num[i].m >> num[i].e;
        num[i].count = num[i].c + num[i].m + num[i].e;
    }
    sort(num, num + n, cmp);
    cout << num[n - 1].name << " " << num[n - 1].c << " " << num[n - 1].m << " " << num[n - 1].e << endl;
    system("pause");
    return 0;
}