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

import static java.lang.Math.*;

public class D {
    static int n;
    static long arr[], dp[][][];
    static final long inf = (long) 1e18;

    public static void main(String[] args) throws Exception {
        Scanner in = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        int test = in.nextInt();
        for (int t = 1; t <= test; t++) {
            n = in.nextInt();
            arr = new long[n];
            for (int i = 0; i < n; i++) {
                arr[i] = in.nextInt();
            }
            dp = new long[3][2][n];
            for (long a[][] : dp) for (long[] b : a) Arrays.fill(b, -1);
            long res = solve(0, 0, 0);
            pw.println(res);
        }

        pw.close();
    }

    static long solve(int pos, int flag, int ed) {
        if (pos >= n) {
            return flag == 0 || flag == 2 ? 0 : -inf;
        }
        if (dp[flag][ed][pos] != -1) return dp[flag][ed][pos];
        long res = solve(pos + 1, flag, ed);
        if (flag == 0 && (pos & 1) == 0) {
            res = max(res, arr[pos] + solve(pos + 1, flag, ed));
            res = max(res, arr[pos] + solve(pos + 1, 1, 0));
            res = max(res, solve(pos + 1, 1, 1));
        }
        if (flag == 2 && (pos & 1) == 0) {
            res = max(res, arr[pos] + solve(pos + 1, flag, ed));
        }
        if (flag == 1 && (pos & 1) == 1) {
            res = max(res, arr[pos] + solve(pos + 1, flag, ed));
            if (ed == 1) res = max(res, arr[pos] + solve(pos + 1, 2, ed));
        }
        if (flag == 1 && (pos & 1) == ed) {
            res = max(res, solve(pos + 1, 2, ed));
        }
        return dp[flag][ed][pos] = res;
    }

    static void debug(Object... obj) {
        System.err.println(Arrays.deepToString(obj));
    }
}