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 Educational90;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class ProblemD {
    public static void main(String[] args)throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringBuilder print=new StringBuilder();
        int test=Integer.parseInt(br.readLine());
        while(test--!=0){
            int n=Integer.parseInt(br.readLine());
            int a[]=new int[n+1];
            StringTokenizer st=new StringTokenizer(br.readLine());
            for(int i=0;i<n;i++){
                a[i]=Integer.parseInt(st.nextToken());
            }
            if(n==1){
                print.append(a[0]+"\n");
                continue;
            }
            if(n==2){
                print.append(Math.max(a[0],a[1])+"\n");
                continue;
            }
//            System.out.println("YES");
            long odd[]=new long[n];
            long even[]=new long[n];
            long diff[]=new long[n];
            for(int i=0;i<n;i++){
//                System.out.println(i);
                if(i!=0) {
                    odd[i] = odd[i - 1];
                    even[i] = even[i - 1];
                }
                if(i%2!=0){
                    odd[i]+=a[i];
                }
                else{
                    even[i]+=a[i];
                }
                diff[i]=odd[i]-even[i];
//                System.out.println(even[i]+" "+odd[i]+" "+diff[i]+" "+i);
            }
//            System.out.println("YES");
            long ans=even[n-1];
//            System.out.println(ans);
            long maxinc=0;
            int s=n%2==0?n-1:n-2;
            long max[]=new long[n];
            max[s]=diff[s];
//            System.out.println(s+" "+max[s]);
            for(int i=s-2;i>=1;i-=2){
                max[i]=Math.max(diff[i],max[i+2]);
//                System.out.println(max[i]+" "+i);
            }
//            System.out.println(ans);
            for(int i=0;i<n;i+=2){
                if(i+1<n) {
                    long inc = max[i + 1];
                    if(i-1>=1){
                        inc-=diff[i-1];
                    }
                    maxinc=Math.max(maxinc,inc);
                }
            }
            s=n%2==0?n-2:n-1;
            max[s]=diff[s];
            for(int i=s-2;i>=0;i-=2){
                max[i]=Math.max(max[i+2],diff[i]);
            }
            for(int i=1;i<n;i++){
                if(i+1<n){
                    long inc=max[i+1];
                    if(i-1>=0){
                        inc-=diff[i-1];
                    }
                    maxinc=Math.max(maxinc,inc);
                }
            }
//            System.out.println("YES");

//            System.out.println("YES");
            ans+=maxinc;
//            System.out.println(ans);
            print.append(ans+"\n");
        }
        System.out.print(print.toString());
    }
}
