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.ArrayList;
import java.util.StringTokenizer;

public class CF1373D {
    public static void main(String[] args) {
        FastReader input = new FastReader();
        PrintWriter pw = new PrintWriter(System.out);

        int t = input.nextInt();

        while (t > 0){
            int n = input.nextInt();

            long[] arr = new long[n];


            long sum = 0;
            for(int i = 0;i < n;i++){
                arr[i] = input.nextLong();
                if(i % 2 == 0){
                    sum += arr[i];
                }
            }


            ArrayList<Long> diff = new ArrayList<>();
            for(int i = 0;i < n-1;i += 2){
                diff.add(arr[i+1] - arr[i]);
            }

            ArrayList<Long> diff2 = new ArrayList<Long>();

            for(int i = 1;i < n-1;i += 2){
                diff2.add(arr[i] - arr[i+1]);
            }

//            pw.println("Diff");
//            for(long l : diff){
//                pw.print(l + " ");
//            }
//            pw.println();
//
//            for(long l : diff2){
//                pw.print(l + " ");
//            }
//            pw.println();

            long maxSum = 0;

            if(diff.size() > 0){
                long total = diff.get(0);

                maxSum = Math.max(maxSum,total);

                for(int i = 1;i < diff.size();i++){
                    if(diff.get(i) > diff.get(i) + total){
                        total = diff.get(i);
                    }
                    else {
                        total = total + diff.get(i);
                    }
                    maxSum = Math.max(maxSum,total);
                }
            }


            long maxSum2 = 0;

            if(diff2.size() > 0){
                long total2 = diff2.get(0);

                maxSum2 = Math.max(maxSum2,total2);

                for(int i = 1;i < diff2.size();i++){
                    if(diff2.get(i) > diff2.get(i) + total2){
                        total2 = diff2.get(i);
                    }
                    else {
                        total2 = total2 + diff2.get(i);
                    }
                    maxSum2 = Math.max(maxSum2,total2);
                }

            }



            long max = Math.max(maxSum,maxSum2);

            if(sum +  max > sum){
                sum = sum + max;
            }
            pw.println(sum);

            t--;
        }

        pw.flush();
        pw.close();
    }
    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;
        }
    }
}
