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
import sys

f = sys.stdin
#f = open("test.txt")
t = int(f.readline())
#what is the even subarray with the maximum difference between even and odd elements?


def minss(arr):
    if(len(arr)==1):
        return arr[0]
    if(len(arr)==0):
        return 0
    minsar = [min(arr)]*len(arr)    #min continguous subset of array ending on the ith element
    minsar[0] = arr[0]
    for i in range(1,len(arr)):
        minsar[i] = max(arr[i],arr[i]+minsar[i-1])
    #return (minsar)
    return max(minsar)
#print(minss([1,1]))

for i in range(t):
    n = int(f.readline())
    a = [int(i) for i in f.readline().strip().split(" ")]
    dlist1 = [a[2*i+1]-a[2*i] for i in range(int(len(a)/2))]
    dlist2 = [a[2*i]-a[2*i-1] for i in range(1,int(len(a)/2+(len(a)%2)))]
    #print(a)
    
    #dlist1 = [-i for i in dlist1]
    dlist2 = [-i for i in dlist2]
    #print(dlist1)
    #print(dlist2)
    #print(minss(dlist1))
    #print(minss(dlist2))
    #print("----")
    ad = max(minss(dlist1),minss(dlist2))
    ae = [a[2*i] for i in range(int(len(a)/2)+(len(a)%2))]
    if(ad>0):
        print(sum(ae)+ad)
    else:
        print(sum(ae))
