B"The title is a reference to the very first Educational Round from our writers team, Educational Round 18. There is a bag, containing colored balls. There are n different colors of balls, numbered from 1 to n . There are mathit{cnt}_i balls of color i in the bag. The total amount of balls in the bag is odd (e. xe2 x80 x89g. mathit{cnt}_1 + mathit{cnt}_2 + ... + mathit{cnt}_n is odd). In one move, you can choose two balls with different colors and take them out of the bag. At some point, all the remaining balls in the bag will have the same color. That's when you can't make moves anymore. Find any possible color of the remaining balls. The first line contains a single integer t ( 1 <= t <= 1000 ) -- the number of testcases. The first line of each testcase contains a single integer n ( 1 <= n <= 20 ) -- the number of colors. The second line contains n integers mathit{cnt}_1, mathit{cnt}_2, ... , mathit{cnt}_n ( 1 <= mathit{cnt}_i <= 100 ) -- the amount of balls of each color in the bag. The total amount of balls in the bag is odd (e. xe2 x80 x89g. mathit{cnt}_1 + mathit{cnt}_2 + ... + mathit{cnt}_n is odd). For each testcase, print a single integer -- any possible color of the remaining balls, after you made some moves and can't make moves anymore. In the first testcase, your first and only move can be one of the following: After the move, exactly one ball will remain. Its color can be 3, 2 or 1 depending on the move. In the second testcase, you can't make moves at all -- there is only color of balls already. This color is 1 . In the third testcase, you can keep removing one ball of color 1 and one ball of color 2 until there are no more balls of color 1 . At the end, three balls of color 2 remain. "...