B"There are n piranhas with sizes a_1, a_2, ldots, a_n in the aquarium. Piranhas are numbered from left to right in order they live in the aquarium. Scientists of the Berland State University want to find if there is dominant piranha in the aquarium. The piranha is called dominant if it can eat all the other piranhas in the aquarium (except itself, of course). Other piranhas will do nothing while the dominant piranha will eat them. Because the aquarium is pretty narrow and long, the piranha can eat only one of the adjacent piranhas during one move. Piranha can do as many moves as it needs (or as it can). More precisely: When the piranha i eats some piranha, its size increases by one ( a_i becomes a_i + 1 ). Your task is to find any dominant piranha in the aquarium or determine if there are no such piranhas. Note that you have to find any (exactly one) dominant piranha, you don't have to find all of them. For example, if a = [5, 3, 4, 4, 5] , then the third piranha can be dominant. Consider the sequence of its moves: You have to answer t independent test cases. The first line of the input contains one integer t ( 1 <= t <= 2 cdot 10^4 ) -- the number of test cases. Then t test cases follow. The first line of the test case contains one integer n ( 2 <= n <= 3 cdot 10^5 ) -- the number of piranhas in the aquarium. The second line of the test case contains n integers a_1, a_2, ldots, a_n ( 1 <= a_i <= 10^9 ), where a_i is the size of the i -th piranha. It is guaranteed that the sum of n does not exceed 3 cdot 10^5 ( sum n <= 3 cdot 10^5 ). For each test case, print the answer: -1 if there are no dominant piranhas in the aquarium or index of any dominant piranha otherwise. If there are several answers, you can print any. The first test case of the example is described in the problem statement. In the second test case of the example, there "...