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 find_max_sum(a):
    if(len(a) == 1):
        return 0
    if(len(a) == 2):
        return (a[0] + a[1])
    if(len(a) == 3):
        return max(a[0]+a[1],a[1]+a[2])
    n = int(len(a) / 2)
    l_max = find_max_sum(a[0:n])
    r_max = find_max_sum(a[n:len(a)])
    
    lsum_odd = a[n-1]
    lsum_even = float('-inf')
    rsum_odd = a[n]
    rsum_even = float('-inf')
    x = 0
    for i in range(0,n):
        x += a[n-1-i]
        if(i % 2 == 0) and (x > lsum_odd):
            lsum_odd = x
        if(i % 2 != 0) and (x > lsum_even):
            lsum_even = x
    x = 0
    for i in range(0,len(a)-n):
        x += a[n+i]
        if(i % 2 == 0) and (x > rsum_odd):
            rsum_odd = x
        if(i % 2 != 0) and (x > rsum_even):
            rsum_even = x
    max_sum = max(l_max,r_max,lsum_odd+rsum_odd,lsum_even+rsum_even)
    return max_sum

def find_max_sum_evenpos(a):
    sum = 0
    b = []
    for i in range(0,len(a)):
        if(i % 2 == 0):
            sum += a[i]
            b.append(-a[i])
        else:
            b.append(a[i])
    return max(sum,sum+find_max_sum(b))

n = int(input())
for i in range(0,n):
    a = []
    input()
    s = input().split(" ")
    for j in s:
        a.append(int(j))
    print(find_max_sum_evenpos(a))