There are $N$ teams participating in a tournament. Each team is assigned an ID. In this tournament, the ID of the first team is $1$, second team is $2$, and so on till $N$. The strength of each team is decided by the strength that it contains in the following units:

• Batting
• Bowling
• Fielding
• All-rounder's performance
• Captain's performance

Now, a team can win against another team if it can win at least 3 units. If a team's strength in a specific unit is higher than the other team, then the former team wins that specific unit. In case, the strength of both teams are the same in a specific unit, then the team that contains the lower team ID wins that unit.
The fixture of the tournament is decided as follows:

In each round, among the remaining teams, the team that is assigned the lowest team ID plays with the team that contains the next lowest team ID. For example, the team that contains the $3^{rd}$ lowest ID plays with the team that is assigned the $4^{th}$ lowest ID and so on.

Note: If a team loses a game, then it is out of the tournament.

Your task is to determine the winning team of the tournament and print its respective team ID.

Input format

• First line: $T$ denoting the number of test cases
• Each test case contains $N+1$ lines:
  • First line: $N$ denoting the number of teams participating in the tournament
  • Next $N$ lines: Five numbers representing the batting, bowling, fielding, all-rounder's, and captain's strength of the $i^{th}$ team respectively

Output format
For each test case, print the ID of the winning team in a separate line.

Constraints
$1 \le T \le 10\\ 1 \le N \le 100000\\ 1 \le strength \le 100\\ N = 2^m where\ m = 0, 1, 2, .....$