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
from copy import deepcopy
def kadane(arr):
	ans = 0
	ansi = 0
	ansj = 0

	present_sum = 0
	present_i = 0

	for i in range(len(arr)):
		present_sum += arr[i]

		if(present_sum > ans):
			ans = present_sum
			ansi = present_i
			ansj = i

		if(present_sum < 0):
			present_sum = 0
			present_i = i + 1


	return ans, ansi, ansj









for t in range(int(input())):
	n = int(input())
	a = list(map(int, input().split(" ")))
	
	a1 = []
	i = 0
	while(i < len(a)-1):
		a1.append(a[i+1] - a[i])
		i += 2

	ans1, i1, j1 = kadane(a1)
	ans1, i1, j1 = ans1 , i1*2, (j1*2)+1

	i = 1
	a1 = []

	while(i < len(a)-1):
		a1.append(a[i] - a[i+1])
		i += 2

	ans2, i2, j2 = kadane(a1)
	ans2, i2, j2 = ans2 , (i2*2)+1, (j2*2)+2

	if(ans1 > ans2):
		b = a[0:i1] 
		c = deepcopy(a[i1 : j1+1] )
		c.reverse()
		b += c
		if (j1 < len(a) - 1):
			b += a[j1 + 1 : ]

	elif (ans2 > ans1):
		b = a[0:i2] 
		c = deepcopy(a[i2 : j2+1] )
		c.reverse()
		b += c

		if (j2 < len(a) - 1):
			b += a[j2 + 1 : ]
	elif (ans1 == ans2):
		if(ans1 == 0):
			b = a
		else:
			b = a[0:i2] 
			c = deepcopy(a[i2 : j2+1] )
			c.reverse()
			b += c

			if (j2 < len(a) - 1):
				b += a[j2 + 1 : ]

	i = 0
	ans = 0
	while(i < len(b)):
		ans += b[i]
		i += 2

	print(ans)








