Question_06.md

Question 6

There are n movies to watch during this weekend. Each movie can be characterized by two integers Li and Ri, denoting the length and the rating of the corresponding movie. We want to watch exactly one movie with the maximal value of Li × Ri. If there are several such movies, he would pick a one with the maximal Ri among them. If there is still a tie, he would pick the one with the minimal index among them.

Your task is to pick a movie to watch during this weekend.

Input

• The first line of the input contains an integer T denoting the number of test cases.

  • The first line of the test case description contains an integer n.

  • The second line of the test case description contains n integers L1, L2, ...,Ln. The following line contains n integers R1, R2, ..., Rn.

Output

For each test case, output a single integer i denoting the index of the movie that Egor should watch during this weekend. Note that we follow 1-based indexing.

Constraints

• 1 ≤ T ≤ 5
• 1 ≤ n ≤ 100
• 1 ≤ Li, Ri ≤ 100

Example

Input:

• 2
• 2
• 1 2
• 2 1
• 4
• 2 1 4 1
• 2 4 1 4

Output:

• 1
• 2