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

// import java.text.DecimalFormat; 
// import java.text.DecimalFormatSymbols; 
 
 
// Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail
 
public class TestClass {
    public static void main(String args[] ) throws Exception {
        /* Sample code to perform I/O:
         * Use either of these methods for input
 
        //BufferedReader
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String name = br.readLine();                // Reading input from STDIN
        System.out.println("Hi, " + name + ".");    // Writing output to STDOUT
 
        //Scanner
        Scanner s = new Scanner(System.in);
        String name = s.nextLine();                 // Reading input from STDIN
        System.out.println("Hi, " + name + ".");    // Writing output to STDOUT
        
        for Round off
         DecimalFormat deciFormat = new DecimalFormat(); 
        deciFormat.setMaximumFractionDigits(9); 
        */
 
        // Write your code here
        StringBuffer str = new StringBuffer();
        PrintWriter pw=new PrintWriter(System.out);
        Scanner scn=new Scanner(System.in);    

        int T = scn.nextInt();

        while(T-->0){
            int n = scn.nextInt();
            long[] dp = new long[n];
            long[] a = new long[n];
            
            a[0]=scn.nextLong();
            long sum=a[0];
            int in=0;
            for(int i=1;i<n;i++){
                a[i]=scn.nextLong();
                if(i%2==0)
                    sum+=a[i];
                else 
                    dp[in++]=a[i]-a[i-1];
            }
            long mf=dp[0];
            long cm=dp[0];
            //pw.println(sum+" "+dp[0]);
            for(int i=1;i<in;i++){
                //pw.println(dp[i]);
                cm = Math.max(dp[i],cm+dp[i]);
                mf = Math.max(mf,cm);
            }
            //sum=Math.max(0,mf);
            long t=mf;
            in=0;
            
            for(int i=2;i<n;i+=2){
                dp[in++]=a[i-1]-a[i];
            }
            mf=dp[0];
            cm=dp[0];
            //pw.println(sum+" "+dp[0]);
            for(int i=1;i<in;i++){
                //pw.println(dp[i]);
                cm = Math.max(dp[i],cm+dp[i]);
                mf = Math.max(mf,cm);
            }
            sum=sum+Math.max(0,Math.max(t,mf));
                
           
            str.append(sum+"\n");
        }
        pw.println(str.toString());
        
        pw.close();
    }
   
   
   
   
   
   
   
   
   
   
   
   
   
   
   
   
   
   
   
   
   
   
   
   
    
}