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 D_Maximum_Sum_on_Even_Positions{
    public static void main(String[] args) {
        FastScanner s= new FastScanner();
        StringBuilder res = new StringBuilder();
        int t=s.nextInt();
        int p=0;
        while(p<t){
        int n=s.nextInt();
        int array[]= new int[n];
        long sum=0;
        for(int i=0;i<n;i++){
            array[i]=s.nextInt();
            if(i%2==0){
                sum+=array[i];
            }
        }
        if(n==1){
            res.append(sum+"\n");
            p++;
            continue;
        }
        long dp[]= new long[n];
        if((n-2)%2==0){
            if(array[n-2]<array[n-1]){
                dp[n-2]=array[n-1]-array[n-2];
                if(dp[n-2]<0){
                    dp[n-2]=0;
                }
            }
            
        }
        else{
            if(array[n-2]>array[n-1]){
                dp[n-2]=array[n-2]-array[n-1];
                if(dp[n-2]<0){
                    dp[n-2]=0;
                }
            }
        }
        if(n==2){
           res.append((sum+dp[0])+"\n");
           p++;
           continue;
        }


        if((n-3)%2==0){
            if(array[n-3]<array[n-2]){
                dp[n-3]=array[n-2]-array[n-3];
                if(dp[n-3]<0){
                    dp[n-3]=0;
                }
            }
            
        }
        else{
            if(array[n-3]>array[n-2]){
                dp[n-3]=array[n-3]-array[n-2];
                if(dp[n-3]<0){
                    dp[n-3]=0;
                }
            }
        }
        long max=Math.max(dp[n-2],dp[n-3]);
        
        for(int i=n-4;i>=0;i--){
            if(i%2==0){
                long k=array[i+1]-array[i];
                k+=dp[i+2];
                if(k>0){
                    dp[i]=k;
                }
            }
            else{
                long k=array[i]-array[i+1];
                k+=dp[i+2];
                if(k>0){
                    dp[i]=k;
                }

            }
            max=Math.max(max,dp[i]);
        }
        // for(int i=0;i<dp.length;i++){
        //     System.out.print(dp[i]+" ");
        // }
        System.out.println();
        long ans=sum+max;
        res.append(ans+"\n");
        p++;
    }
    System.out.println(res);



    }
    static class FastScanner {
		BufferedReader br;
		StringTokenizer st;
 
		public FastScanner(String s) {
			try {
				br = new BufferedReader(new FileReader(s));
			} catch (FileNotFoundException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}
 
		public FastScanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
 
		String nextToken() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}
 
		int nextInt() {
			return Integer.parseInt(nextToken());
		}
 
		long nextLong() {
			return Long.parseLong(nextToken());
		}
 
		double nextDouble() {
			return Double.parseDouble(nextToken());
		}
	}




}