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 maxSubArraySum(a,size): 
      
    max_so_far =a[0] 
    curr_max = a[0] 
      
    for i in range(1,size): 
        curr_max = max(a[i], curr_max + a[i]) 
        max_so_far = max(max_so_far,curr_max,0) 
          
    return max(max_so_far,0)

for _ in range(int(input())):
    N=int(input())
    A=list(map(int,input().split()))
    temp1=[]
    temp2=[]
    if(N==1):
        print(A[0])
    else:
        if(N%2==0):
            suma=0
            for i in range(0,N,2):
                temp1.append(A[i+1]-A[i])
                suma+=A[i]
            for i in range(1,N-1,2):
                temp2.append(A[i]-A[i+1])
            # print(temp1)
            t=maxSubArraySum(temp1,len(temp1))
            if(len(temp2)==0):
                t2=0
            else:
                t2=maxSubArraySum(temp2,len(temp2))
            r=max(t,t2)
            print(r+suma)
        else:
            suma=0
            for i in range(0,N-1,2):
                temp1.append(A[i+1]-A[i])
                suma+=A[i]
            suma+=A[N-1]
            # print(suma)
            for i in range(1,N,2):
                temp2.append(A[i]-A[i+1])
            t1=maxSubArraySum(temp1,len(temp1))
            t2=maxSubArraySum(temp2,len(temp2))
            r=max(t1,t2)
            # print(r)
            print(suma+r)