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.*;
import java.io.*;
public class Main {
    static int INF = 1001001009;
    static Scanner sc = new Scanner(System.in);
    static PrintWriter out = new PrintWriter(System.out);
    static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    long mod = 1000000000+7;
    public static void main(String[] args) throws Exception {
        // Your code here!
        Main main = new Main();
        int t = main.paIn(reader.readLine());
        while(t-->0){
            main.solve();
        }
//        long ans = main.solve();
//        out.println(ans);
//        main.solve();
        out.flush();
    }
    void solve() throws Exception{
        int n = paIn(reader.readLine());
        String[] buf = reader.readLine().split(" ");
        long[] a = new long[n+1];
        for(int i=1; i<=n ;i++) a[i] = paIn(buf[i-1]);
        long[] oddSum = new long[n+1], evenSum = new long[n+1];
        // 0-index even => 1-index odd
        for(int i=1; i<=n; i++){
            oddSum[i] = oddSum[i-1];
            evenSum[i] = evenSum[i-1];
            if(i%2==1) oddSum[i] += a[i];
            else evenSum[i] += a[i];
        }
        long ans = oddSum[n], base = oddSum[n]; // base line
        // minimize even[j]-odd[j]
        long diffEven = 0, diffOdd = evenSum[1]-oddSum[1];
        for(int i=2; i<=n; i++){
            long curDiff = evenSum[i]-oddSum[i], delta;
            if(i%2==1){
                delta = curDiff - diffOdd;
                diffOdd = Math.min(diffOdd, curDiff);
            } else{
                delta = curDiff - diffEven;
                diffEven = Math.min(diffEven, curDiff);
            }
            ans = Math.max(ans, base+delta);
        }
        out.println(ans);
    }
    int paIn(String s){return Integer.parseInt(s);}
}