B'There are n cards stacked in a deck. Initially, a_{i} is written on the i -th card from the top. The value written on a card does not change. You will play a game. Initially your score is 0 . In each turn, you can do one of the following operations: What is the maximum score you can get when the game ends? ^{ dagger} An integer i is odd, if there exists an integer k such that i = 2k + 1 . ^{ ddagger} An integer i is even, if there exists an integer k such that i = 2k . Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^{4} ). The description of the test cases follows. The first line of each test case contains a single integer n ( 1 <= n <= 2 cdot 10^{5} ). The second line of each test case contains n integers a_1, a_2, ldots, a_n ( -10^{9} <= a_i <= 10^{9} ). It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^{5} . For each test case, print a single integer -- the maximum score you can get when the game ends. In the first test case, one can get the score of 5 as follows: In the second test case, one can get the score of 4 as follows: In the third test case, one can get the score of 2 as follows: '...