Find the Fastest Team

You are given N teams where every team consists of 4 runners. Each team has a total race time which is the sum of the 4 individual runner times. Mathematically, for each team, the total race time is given by \( S = \sum_{j=1}^{4} t_j \), where \( t_j \) represents the time taken by the j-th runner. Your task is to determine the team with the smallest total race time. In case of a tie, the team with the smallest team number (starting from 1) should be returned.

Example:

Input:
3
12 15 11 14
10 16 13 12
13 14 10 15
Output:
2

</p>

In the above example, the total times of teams are 52, 51, and 52 respectively, and hence team 2 is the fastest.

inputFormat

The first line contains an integer N representing the number of teams. The following N lines each contain 4 space-separated integers. Each line represents the times taken by the 4 runners of a team.

outputFormat

Output a single integer representing the team number with the fastest total race time.

## sample

3
12 15 11 14
10 16 13 12
13 14 10 15

2