The Best Student

Problem Description

There are $N$ students who took the final exam, and we have each student's information: name (a string of only lowercase English letters, length at most $8$), and their Chinese, Math, and English scores (all natural numbers not exceeding $150$). The student with the highest total score is the best; output the best student's information (name and each subject's score). If several students tie for the highest total, output the one who appears earliest.

Input Format

The first line contains a positive integer $N$, the number of students.

The following $N$ lines each begin with a string (the student's name), followed by three natural numbers: the Chinese, Math, and English scores, separated by spaces.

Output Format

One line containing the best student's name, Chinese score, Math score, and English score, separated by spaces.

Sample Input

3
senpai 114 51 4
lxl 114 10 23
fafa 51 42 60

Sample Output

senpai 114 51 4

Sample Explanation

There are $3$ students in the sample. senpai's three scores are $114$, $51$, $4$, total $114+51+4=169$; lxl's are $114$, $10$, $23$, total $114+10+23=147$; fafa's are $51$, $42$, $60$, total $51+42+60=153$. senpai has the highest total, so we output senpai's name, Chinese score $114$, Math score $51$, and English score $4$, as shown above.

Constraints

$1 \le N \le 1000$. The name is a string of only lowercase English letters with length at most $8$. The Chinese, Math, and English scores are natural numbers not exceeding $150$.