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 os

import sys

debug = True

if debug and os.path.exists("input.in"):
    input = open("input.in", "r").readline
else:
    debug = False
    input = sys.stdin.readline


def inp():
    return (int(input()))


def inlt():
    return (list(map(int, input().split())))


def insr():
    s = input()
    return s[:len(s) - 1]  # Remove line char from end


def invr():
    return (map(int, input().split()))


test_count = int(input())

for t in range(test_count):
    if debug:
        print("Test Case #", t + 1)
    # Start code here
    n = inp()
    a = inlt()
    start = 0
    max_total = 0
    max_start = -1
    max_end = -1
    while start < n - 1 and a[start] >= a[start + 1]:
        start += 2
    if start < n - 1 and a[start] < a[start + 1]:
        end = start + 1
        total = a[end] - a[start]
        max_total = total
        max_start = start
        max_end = end
        end += 2
        while end < n:
            total += a[end] - a[end - 1]
            if total < 0:
                start = end + 1
                total = 0
            else:
                if total > max_total:
                    max_total = total
                    max_start = start
                    max_end = end
            end = end + 2

    # start with odd
    start = 1
    while start < n - 1 and a[start] <= a[start + 1]:
        start += 2
    if start < n - 1 and a[start] > a[start + 1]:
        end = start + 1
        total = a[start] - a[end]
        if total > max_total:
            max_total = total
            max_start = start
            max_end = end
        end += 2
        while end < n:
            total += a[end - 1] - a[end]
            if total < 0:
                start = end + 1
                total = 0
            else:
                if total > max_total:
                    max_total = total
                    max_start = start
                    max_end = end
            end = end + 2
    ans = 0
    for i in range(0, n, 2):
        ans += a[i]
    ans += max_total
    # print(max_start, max_end)
    print(ans)
