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.*;

public class mycls2 {
	
	public static int mycls(int n){
		int arr[]=new int[n];
		for(int i=0;i<n;i++){
			arr[i]=i;
		}
		return n;
	}
	public static void main(String[] args)  {
		Scanner scn = new Scanner(System.in);
		int t=scn.nextInt();
		StringBuilder res=new StringBuilder();
		int mtcs=0;
	while (mtcs++ < t) {
			int mn = scn.nextInt();
			long mv[] = new long[mn];
			long s = 0;
			for (int i = 0; i < mn; i++) {
				mv[i] = scn.nextLong();
				if (i % 2 == 0)
					s += mv[i];
			}
			int rr=0;
			ArrayList<Long> first = new ArrayList<>();
			ArrayList<Long> sec = new ArrayList<>();
			int rrr=mycls(6);
			for (int i = 1; i < mn; i += 2) {
				first.add(mv[i] - mv[i - 1]);
				if (i + 1 < mn)
					sec.add(mv[i] - mv[i + 1]);
			}
			int arr[]=new int[20];
			int am = first.size();
			long msum = Integer.MIN_VALUE, a = 0;
			for (int i = 0; i < am; i++) {
				a = a + first.get(i);
				if (msum < a)
					msum = a;
				if (a < 0)
					a = 0;
				rr=mycls(7)+arr[3];
			}
			long ms = msum;
			msum = 0;
			a = 0;
			rr+=rrr;
			int mm = sec.size();
			for (int i = 0; i < mm; i++) {
				a = a + sec.get(i);
				if (msum < a)
					msum = a;
				if (a < 0)
					a = 0;
				rr+=mycls(22)+arr[3];
			}
			ms = Math.max(ms, msum);
			if (ms < 0)
				ms = 0;
			rrr+=mycls(2);
			long ans = ms + s;
			res.append(ans + "\n");
		}
		System.out.println(res);
		}
	}
	
