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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class Main {
    public static void main(String[] args) {
        FastReader input=new FastReader();
        PrintWriter out=new PrintWriter(System.out);
        int t=input.nextInt();
        while(t-->0)
        {
            int n=input.nextInt();
            int a[]=new int[n];
            int s1=n/2;
            long v1[]=new long[s1];
            long se=0;
            for(int i=0;i<n;i++)
            {
                a[i]=input.nextInt();
                if(i%2==0)
                {
                    se+=a[i];
                }
            }
            if(n==1)
            {
                System.out.println(se);
            }
            else
            {
                int c=0;
                for(int i=1;i<n;i+=2)
                {
                    int d=a[i]-a[i-1];
                    v1[c]=d;
                    c++;
                }
                int s=0;
                if(n%2==0)
                {
                    s=n/2-1;
                }
                else
                {
                    s=n/2;
                }
                long v2[]=new long[s];
                c=0;
                for(int i=1;i<n-1;i+=2)
                {
                    int d=a[i]-a[i+1];
                    v2[c]=d;
                    c++;
                }

                long max=Long.MIN_VALUE;
                long minp=0;
                long p=0;
                for(int i=0;i<v1.length;i++)
                {
                    p+=v1[i];
                    minp=Math.min(minp,p);
                    max=Math.max(max,p-minp);
                }
                minp=0;
                p=0;
                for(int i=0;i<v2.length;i++)
                {
                    p+=v2[i];
                    minp=Math.min(minp,p);
                    max=Math.max(max,p-minp);
                }
                long ans=se+max;
                System.out.println(ans);

            }
        }
        out.close();
    }
    public static void mergeSort(ArrayList<Integer> a,int p,int r)
    {
        if(p<r)
        {
            int q=(p+r)/2;
            mergeSort(a,p,q);
            mergeSort(a,q+1,r);
            merge(a,p,q,r);
        }
    }
    public static void merge(ArrayList<Integer> a,int p,int q,int r)
    {
        int n1=q-p+2;
        int L[]=new int[n1];
        int n2=r-q+1;
        int R[]=new int[n2];
        for(int i=p;i<=q;i++)
        {
            L[i-p]=a.get(i);
        }
        L[n1-1]=Integer.MAX_VALUE;
        for(int i=q+1;i<=r;i++)
        {
            R[i-q-1]=a.get(i);
        }
        R[n2-1]=Integer.MAX_VALUE;
        int x=0,y=0;
        for(int i=p;i<=r;i++)
        {
            if(L[x]<=R[y])
            {
                a.set(i,L[x]);
                x++;
            }
            else
            {
                a.set(i,R[y]);
                y++;
            }
        }
    }
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            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;
        }
    }
}
