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 sum_even():
    _sum = 0
    for _i in range(0, len(array), 2):
        _sum += array[_i]
    return _sum


def max_sub_sum(_array):
    dp = [0 for _i in range(len(_array))]
    dp[0] = _array[0]

    for _i in range(1, len(_array)):
        dp[_i] = max(_array[_i], dp[_i - 1] + _array[_i])

    result = dp[0]
    for _i in range(1, len(_array)):
        if dp[_i] > result:
            result = dp[_i]

    return result


n_cases = int(input())
for n in range(0, n_cases):
    length = int(input())
    temp = input()
    array = [int(n) for n in temp.split()]

    if length == 1:
        print(array[0])
        continue

    if length == 2:
        print(max(array[0], array[1]))
        continue

    ori_arr = array.copy()
    ori_sum = sum_even()

    diff_left = []
    diff_right = []
    for i in range(0, length-1, 2):
        diff_left.append(array[i+1]-array[i])
    for i in range(1, length-1, 2):
        diff_right.append(array[i]-array[i+1])

    sum_left = max_sub_sum(diff_left)
    sum_right = max_sub_sum(diff_right)

    if sum_left >= sum_right and sum_left > 0:
        print(ori_sum + sum_left)
    elif sum_right >= sum_left and sum_right > 0:
        print(ori_sum + sum_right)
    else:
        print(ori_sum)

