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 Solution
{
    public static long MAX(long a,long b)
    {
        if(a>b)
            return a;
        return b;
    }
    public static void main(String[] args) throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int t = Integer.parseInt(br.readLine());
        while(t-->0)
        {
            int n = Integer.parseInt(br.readLine());
            String[] inp = br.readLine().split(" ");
            int[] a = new int[n];
            for(int i=0;i<n;i++)
                a[i] = Integer.parseInt(inp[i]);
            int start = 0,end=0,pos1=0;
            long sum=0,max=0;
            for(int i=1;i<n;i=i+2)
            {
                sum+=a[i]-a[i-1];
                if(sum<0)
                {
                    pos1=i+1;
                    sum=0;
                }
                else if(sum>max)
                {
                    max = sum;
                    start = pos1;
                    end = i;
                }
            }
            int[] b = new int[n];
            for(int i=0;i<n;i++)
                b[i] = a[i];
            int x=start,y=end;
            while(x<y)
            {
                int temp = b[x];
                b[x] = b[y];
                b[y]=temp;
                x++;
                y--;
            }
            long sum1=0;
            for(int i=0;i<n;i=i+2)
                sum1+=b[i];
            for(int i=0;i<n;i++)
                b[i]=a[i];
            start = 1;end=1;sum=0;max=0;pos1=1;
            for(int i=1;i<n-1;i=i+2)
            {
                sum+=a[i]-a[i+1];
                if(sum<0)
                {
                    pos1=i+2;
                    sum=0;
                }
                else if(sum>max)
                {
                    max = sum;
                    start = pos1;
                    end = i+1;
                }
            }
            x=start;y=end;
            
            while(x<y)
            {
                int temp = b[x];
                b[x] = b[y];
                b[y]=temp;
                x++;
                y--;
            }
            long sum2=0;
            for(int i=0;i<n;i=i+2)
                sum2+=b[i];
            long s=MAX(sum1,sum2);
            bw.write(s+"\n");
        }
            
        bw.flush();
    }
}