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 java.util.*;

public class Main {

    public static int main(int n) {
        int array[] = new int[n];
        for (int i = 0; i < n; i++) {
            array[i] = i;
        }
        return n;
    }

    public static void main(String[] args) {
        Scanner scn = new Scanner(System.in);
        int t = scn.nextInt();
        StringBuilder res = new StringBuilder();
        int counter = 0;
        while (counter++ < t) {
            int n = scn.nextInt();
            Long a1[] = new Long[n];
            long s = 0;
            for (int i = 0; i < n; i++) {
                a1[i] = scn.nextLong();
                if (i % 2 == 0)
                    s = a1[i] + s;
            }
            int counter1 = 0;
            ArrayList<Long> arrayList1 = new ArrayList<>();
            ArrayList<Long> arrayList2 = new ArrayList<>();
            int a3 = main(6);
            for (int i = 1; i < n; i += 2) {
                arrayList1.add(a1[i] - a1[i - 1]);
                if (i + 1 < n)
                    arrayList2.add(a1[i] - a1[i + 1]);
            }
            int array2[] = new int[20];
            int array_size = arrayList1.size();
            long min = Integer.MIN_VALUE, a = 0;
            for (int i = 0; i < array_size; i++) {
                a = a + arrayList1.get(i);
                if (min < a)
                    min = a;
                if (a < 0)
                    a = 0;
                counter1 = main(7) + array2[3];
            }
            long max = min;
            min = 0;
            a = 0;
            counter1 += a3;
            int mm = arrayList2.size();
            for (int i = 0; i < mm; i++) {
                a = a + arrayList2.get(i);
                if (min < a)
                    min = a;
                if (a < 0)
                    a = 0;
                counter1 += main(22) + array2[3];
            }
            max = Math.max(max, min);
            if (max < 0)
                max = 0;
            a3 = main(2) + a3;
            long ans = max + s;
            res.append(ans + "\n");
        }
        System.out.println(res);
    }
}
