Problem A - Departmental Awards
-------------------------------

You have been asked to compute the top ranking student(s) in the CSE
department. While this is not difficult, it is tedious to do by hand. Your
program should solve the problem, satisfying the following rules:

1. Ranking is by GPA's.
2. Ties are broken by the sum of the two highest grades obtained by students. 
3. If a tie still happens, students are to be declared joint winners.

Input
-----

The input consists of several different sets of data. The first line tells 
you how many sets there are. Each set has one line per student and then a line
containing only the word "end".

Each line before the one that reads "end" consists of a name (no more than 
15 chars long) and 5 different integers in the range 0 through 9 (both 
inclusive), with 0 corresponding to F and 9 corresponding to A+. Assume that 
each set has at most 50 students.

Output
------

For each data set, output the top ranking students. If there are ties, the 
names must be sorted in alphabetical order and output on the same line 
separated by a single space character.

Sample Input
------------

1
John 0 1 4 4 8
Jim 8 8 8 8 8 
Alice 9 9 8 7 7
end

Output for Sample Input
-----------------------

Alice