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
//note: 0<=|int|<=2 * 10^9
//note: 0<=|long|<= 9 * 10^18

import java.io.*;
import java.util.*;
 
public class MyProgram{
    static ArrayList<Integer>[] adj;
    
    private static StringTokenizer st;
    private static BufferedReader br;
   
    public static void main(String[] args) throws IOException{
        MyScanner sc = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));
        
        int t = sc.nextInt();
        for(int i = 0; i <t; i++){
            int n = sc.nextInt();
            long[] arr = new long[n];
            
            long orig_sum = 0;
            int count = 0;
            for(int j = 0; j < n; j++){
                arr[j] = sc.nextLong();
                if(count % 2 == 0){
                    orig_sum += arr[j];
                }
                count++;
            }
            
            //reverse last terms
            long max_one = 0;
            long curr_one = Integer.MIN_VALUE;
            for(int j = 1; j+1 < n; j+=2){
                long a = arr[j];
                long b = arr[j+1];
                long add = a-b;
                
                curr_one = Math.max(add, curr_one + add);
                max_one = Math.max(max_one, curr_one);
            }
            long case_one = orig_sum + max_one;
            
            long max_two = 0;
            long curr_two = Integer.MIN_VALUE;
            for(int j = 0; j+1 < n; j+=2){
                long a = arr[j];
                long b = arr[j+1];
                long add = b-a;
                
                curr_two = Math.max(add, curr_two + add);
                max_two = Math.max(max_two, curr_two);
            }
            long case_two = orig_sum + max_two;
            
            if(case_two > case_one){
                System.out.println(case_two);
            }
            else{
                System.out.println(case_one);
            }
            
            
        }
        
        out.close();
    }
    
    static class Comp implements Comparator<int[]>{
        public int compare(int[] i1, int[] i2){
            if(i2[1] - i2[0] == i1[1] - i1[0]){
                return Integer.compare(i1[0], i2[0]);
            }
            else{
                return Integer.compare(i2[1]-i2[0],i1[1]-i1[0]);
            }
        }
    } 
   
   //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;
      
   //-----------MyScanner class for faster input----------
    public static class MyScanner {
 
      public MyScanner() {
         br = new BufferedReader(new InputStreamReader(System.in));
      }
 
      String next() {
          while (st == null || !st.hasMoreElements()) {
              try {
                  st = new StringTokenizer(br.readLine());
              } catch (IOException e) {
                  e.printStackTrace();
              }
          }
          return st.nextToken();
      }
 
      int nextInt() {
          return Integer.parseInt(next());
      }
 
      long nextLong() {
          return Long.parseLong(next());
      }
 
      double nextDouble() {
          return Double.parseDouble(next());
      }
 
      String nextLine(){
          String str = "";
	  try {
	     str = br.readLine();
	  } catch (IOException e) {
	     e.printStackTrace();
	  }
	  return str;
      }

   }
   //--------------------------------------------------------
}