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
from collections import defaultdict, deque, Counter
import math

# import copy
from bisect import bisect_left, bisect_right
# import heapq

# sys.setrecursionlimit(1000000)

# input aliases
input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)

def max_sabun(arr):
    tmn = 0
    ret = 0
    for ar in arr:
        if ar - tmn > ret:
            ret = ar - tmn
        if ar < tmn:
            tmn = ar

    return ret

def solve():
    n = getN()
    nums = getList()
    sev, sod = 0, 0
    for i in range(n):
        if i % 2 == 0:
            sev += nums[i]
        else:
            sod += nums[i]
    ar1 = [0]
    # ar2 = [0]
    # sa = 0
    ans = 0
    for i in range(n// 2):
        sa = nums[i * 2 + 1] - nums[i * 2]
        ar1.append(ar1[-1] + sa)
        # ar2.append(ar2[-1] - sa)
    # print(ar1)
    if sev + max_sabun(ar1) > ans:
        ans = sev + max_sabun(ar1)
    # if sod + max_sabun(ar2) > ans:
    #     ans = sod + max_sabun(ar2)

    ar1 = [0]
    # ar2 = [0]
    # sa = 0
    for i in range((n - 1) // 2):
        sa = nums[i * 2 + 1] - nums[i * 2 + 2]
        ar1.append(ar1[-1] + sa)
        # ar2.append(ar2[-1] - sa)

    if sev + max_sabun(ar1) > ans:
        ans = sev + max_sabun(ar1)
    # if sod + max_sabun(ar2) > ans:
    #     ans = sod + max_sabun(ar2)

    # print(sev, sod, ar1)
    print(ans)

def main():
    n = getN()
    for _ in range(n):
        solve()


if __name__ == "__main__":
    main()
    # solve()