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
/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc=new Scanner(System.in);
		int t=sc.nextInt();
		for(int l=0;l<t;l++){
		  int n=sc.nextInt();
		  int a[]=new int[n];
		  int odd[]=new int[n/2];
		  int even[]=new int[n/2+n%2];
		  for(int i=0;i<n;i++){a[i]=sc.nextInt();}
		  long sum=0;
		  for(int i=0;i<n;i+=2){even[i/2]=a[i];sum+=even[i/2];}
		  for(int i=1;i<n;i+=2){odd[i/2]=a[i];}
		  long pre[]=new long[odd.length];
          for(int i=0;i<odd.length;i++){pre[i]=pre[i]+odd[i]-even[i];}
          long after[]=new long[Math.min(even.length,odd.length)];
          for(int i=0;i<even.length-1&&i<odd.length;i++){
              //System.out.println(odd[i]+" "+even[i+1]);
              after[i]=after[i]+odd[i]-even[i+1];
              
          }
          long max=0;
          if(pre.length>0) max=Math.max(0,pre[0]);
          for(int i=1;i<odd.length;i++){
             // System.out.print(pre[i]+" ");
              pre[i]=Math.max(pre[i],pre[i]+pre[i-1]); 
              max=Math.max(pre[i],max);
              
          }
          if(after.length>0)max=Math.max(after[0],max);
          //System.out.println();
          for(int i=1;i<even.length-1&&i<odd.length;i++){
              //System.out.print(after[i]+" ");
              after[i]=Math.max(after[i],after[i]+after[i-1]); 
              max=Math.max(after[i],max);
          }
          System.out.println(sum+max);
		}
	}
}
