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
#even places
def kadane(arr):
#     max_values = [0]
    max_current = arr[0]
    max_global = arr[0]
    n = len(arr)
    for i in range(1, n):
        max_current = max(arr[i], max_current+arr[i])
        if(max_current > max_global):
            max_global = max_current
#     return[max_till_indices, max_global]
    return(max_global)


t = int(input())
for tc in range(t):
    length = int(input())
    if(length == 1):
        n = int(input())
        print(n)
        continue
    if(length == 2):
        line = input().split()
        print(max(int(line[0]), int(line[1])))
        continue
    line = input().split()
    arr = []
    diff1 = []
    diff2 = []
    for x in line:
        arr.append(int(x))
    if(length % 2 == 0):
        for x in range(0, length-1, 2):
            diff1.append(arr[x+1] - arr[x])
            
        for x in range(1, length-2, 2):
            diff2.append(arr[x] - arr[x+1])
#             x += 1
    if(length % 2 != 0):
        for x in range(0, length-1, 2):
            diff1.append(arr[x+1] - arr[x])
            
        for x in range(1, length-1, 2):
            diff2.append(arr[x] - arr[x+1])
#     print(diff1, diff2)
#     print(kadane(diff1), kadane(diff2))
    add_this = max(kadane(diff1), kadane(diff2))
#     print(add_this)
    if(add_this < 0):
        add_this = 0
    
    for x in range(0, length, 2):
        add_this += arr[x]
    print(add_this)
