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
t = int(input())
for _ in range(t):
	n = int(input())
	arr = [int(var) for var in input().split()]
	if n < 3 :
		print(max(arr))
	else:
		arr1, arr2 = [], []
		
		for oddIdx in range(1, n, 2): # 0, 1
			arr1.append(arr[oddIdx] - arr[oddIdx-1])

		for evenIdx in range(2, n, 2): # 2, 1
			arr2.append(arr[evenIdx-1] - arr[evenIdx])

		total = sum(arr[x] for x in range(0, n, 2))

		maxSubArray1, maxSubArray2 = [0 for _ in range(len(arr1))], [0 for _ in range(len(arr2))]
		maxSubArray1[0], maxSubArray2[0] = max(0, arr1[0]), max(0, arr2[0])

		for i in range(1, len(arr1)):
			 maxSubArray1[i] = max(maxSubArray1[i-1]+arr1[i], arr1[i], 0)

		for i in range(1, len(arr2)):
			maxSubArray2[i] = max(maxSubArray2[i-1]+arr2[i], arr2[i], 0)

		print(total+max(max(maxSubArray2), max(maxSubArray1)))