Programming-trampoline-athlon!#11750

Programming-trampoline-athlon!

1 second

128 megabytes

Easy

Programming competitions are fun and exciting. Programming should be an Olympic sport! At least, this is what we believe. However, when we suggested this to some of our friends, they did not seem to share our excitement. So, we decided to suggest a combined sport that will be more interesting to watch. Programming-trampoline-athlon! (we are still working on the name.)

The idea is as follows. This is a team sport, where each team comprises $3$ members. The team has at its disposal $1$ hour, $1$ computer, and $1$ trampoline. At all times, there must be at most one team member using the computer and at least one team member jumping the trampoline. At the beginning of the competition, the team is given $6$ programming problems, and $6$ trampoline elements (exercises). The team decides how to partition the trampoline elements between its members, such that each team member has to perform $2$ of the given elements on the trampoline. The programming tasks are solved cooperatively by the team members, but no one member can spend more than $25$ minutes on the computer in total. The scoring is comprised of two parts, which are added together:

The programming score ranges between $0$ and $60$ . The team receives $10$ points for every correctly solved problem.
The trampoline score ranges between $0$ and $40$ . Each of the $6$ trampoline elements receives a score from the judges that ranges between $0$ and $10$ . The final trampoline execution score is determined by dropping the highest and lowest of the $6$ scores, and then adding up the remaining $4$ scores.

Before we pitch this new sport to the International Olympic Committee, we want everything to be ready in order to show them just how serious we are. Thus, each team should receive a medal when no more than two other teams obtained a strictly higher score. However, in order to cope with a recent shortage of medals, the jury was instructed to make sure that there would be no more than $1000$ teams deserving a medal. We ask you to write a program that determines the medallists, given the performance of the different teams.

Input

The first line contains the number $n (3 \leq n \leq 1 0^{5})$ n~(3 \le n \le 10^5) of competing teams. Then follow $n$ lines. Each of these lines describes a team and contains values $c, p, e_{1}, e_{2}, e_{3}, e_{4}, e_{5}, e_{6}$ c, p, e_1, e_2, e_3, e_4, e_5, e_6; $c$ is a five-letter code used to identify the team, $p (0 \leq p \leq 6)$ p~(0 \le p \le 6) is an integer specifying the number of problems the team solved, and $e_{i} (0 \leq e_{i} \leq 10)$ e_i~(0 \le e_i \le 10) is an integer specifying the execution score of trampoline element number $i$ . Different teams always have different team codes.

Output

Print $m (3 \leq m \leq 1000)$ m~(3 \le m \le 1000) lines, where $m$ is the number of medallists. Each line should represent a medallist team, by containing two values $c$ and $s$ , where $c$ is the team code and $s$ is the total score of the team. Medallist teams should be listed by decreasing total score and, in case of ties, by input order.

Examples

Example 1

Example 2