#K56917. Top Performer Finder

    ID: 30305 Type: Default 1000ms 256MiB

Top Performer Finder

Top Performer Finder

You are given data for multiple employees. For each employee, you are provided with a name and three integer scores representing teamwork, punctuality, and productivity.

Your task is to determine the top performer. The top performer is defined as the employee with the highest total score, where the total score \(S\) is calculated as:

[ S = \text{teamwork} + \text{punctuality} + \text{productivity} ]

If there is a tie (i.e. two or more employees have the same total score), then the employee who appears first in the input is chosen.

inputFormat

The input is read from standard input (stdin). The first line contains an integer \(N\) (\(1 \le N \le 10^5\)), the number of employees. Each of the following \(N\) lines contains a string and three integers separated by spaces. The string represents the employee's name (without spaces) and the three integers represent the teamwork, punctuality, and productivity scores respectively.

outputFormat

Output a single line to standard output (stdout) containing the name of the top performer.

## sample
1
Alice 500 600 700
Alice

</p>