You are given an array a consisting of n integers. Indices of the array start from zero (i. e. the first element is a_0, the second one is a_1, and so on).

You can reverse at most one subarray (continuous subsegment) of this array. Recall that the subarray of a with borders l and r is a[l; r] = a_l, a_{l + 1}, ..., a_{r}.

Your task is to reverse such a subarray that the sum of elements on even positions of the resulting array is maximized (i. e. the sum of elements a_0, a_2, ..., a_{2k} for integer k = ⌊(n-1)/(2)⌋ should be maximum possible).

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 2 ⋅ 10^4) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of a. The second line of the test case contains n integers a_0, a_1, ..., a_{n-1} (1 ≤ a_i ≤ 10^9), where a_i is the i-th element of a.

It is guaranteed that the sum of n does not exceed 2 ⋅ 10^5 (∑ n ≤ 2 ⋅ 10^5).

Output

For each test case, print the answer on the separate line — the maximum possible sum of elements on even positions after reversing at most one subarray (continuous subsegment) of a.

Example

Input


4
8
1 7 3 4 7 6 2 9
5
1 2 1 2 1
10
7 8 4 5 7 6 8 9 7 3
4
3 1 2 1


Output


26
5
37
5
def subs(lst):
    curr_max = 0
    global_max = 0
    for i in lst:
        curr_max = max(i, curr_max+i)
        global_max = max(global_max, curr_max)
    return global_max

def solve(lst):
    evens = []
    odds = []
    length = len(lst)
    for i in range(length):
        if i % 2 == 0:
            evens.append(lst[i])
        else:
            odds.append(lst[i])
    diff = []
    diff2 = []
    for i in range(len(odds)):
        try:
            diff.append(odds[i]-evens[i])
            diff2.append(odds[i]-evens[i+1])
        except IndexError:
            pass
    sub1 = subs(diff)
    sub2 = subs(diff2)
    excess = max(sub1, sub2)
    return sum(evens)+excess

test = int(input())
matrix = []
for _ in range(test):
    length = int(input())
    lst = list(map(lambda elem: int(elem), input().split(" ")))
    matrix.append(lst)
for lst in matrix:
    print(solve(lst))
