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 main():
    n = int(input())
    a = list(map(int, input().split()))
    best = [0, 0, 0]
    st = 0
    end = 0
    res = 0
    for i in range(n // 2):
        res += -a[i * 2] + a[i * 2 + 1]
        if res < 0:
            st = -1
            end = -1
            res = 0
        else:
            if st != -1:
                end = i * 2 + 1
            else:
                st = i * 2
                end = i * 2 + 1
            if res > best[0]:
                best[0] = res
                best[1] = st
                best[2] = end
    res = 0
    end = 0
    st = 0
    for i in range(n // 2 - 1 + (n % 2)):
        res += a[i * 2 + 1] - a[i * 2 + 2]
        if res < 0:
            st = -1
            end = -1
            res = 0
        else:
            if st != -1:
                end = i * 2 + 1
            else:
                st = i * 2
                end = i * 2 + 1
            if res > best[0]:
                best[0] = res
                best[1] = st
                best[2] = end
    sm = 0
    for i in range(0, n, 2):
        sm += a[i]
    print(sm + best[0])


if __name__ == '__main__':
    t = int(input())
    for i in range(t):
        main()

"""
New1 New3 1 3
1    0    0 0
1    1    1 0
3    1    3 1
5    3    2 3
"""
