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 sys
sys.setrecursionlimit(10000)
# default is 1000 in python


t = int(input())
# t = 1

for _ in range(t):
	n = int(input())

	a = list(map(int, input().split()))

	even_sum = 0
	# odd_sum = [0]
	all_diffs_start =  []
	all_diffs_non_start =  []


	for i in range(n):
		if i % 2 == 0:
			even_sum += a[i]
			# even_sum.append(even_sum[-1]+a[i])
		else:
			all_diffs_start.append(a[i]-a[i-1])
			try:
				all_diffs_non_start.append(a[i]-a[i+1])
			except:
				pass
	max_sum = 0
	curr_sum = 0
	for adiff in all_diffs_start:
		if curr_sum < 0:
			curr_sum = 0
		curr_sum += adiff
		if curr_sum > max_sum:
			max_sum = curr_sum

	curr_sum = 0
	for adiff in all_diffs_non_start:
		if curr_sum < 0:
			curr_sum = 0
		curr_sum += adiff
		if curr_sum > max_sum:
			max_sum = curr_sum



	print(even_sum+max_sum)
			# odd_sum.append(odd_sum[-1]+a[i])
	# even_sum = even_sum[1:].copy()
	# odd_sum = odd_sum[1:].copy()
	# sum_no = even_sum[-1]


# try:
	# raise Exception
# except:
	# print("-1")
	

# thenos.sort(key=lambda x: x[2], reverse=True)

# int(math.log(max(numbers)+1,2))

# 2**3 (power)

# a,t = (list(x) for x in zip(*sorted(zip(a, t))))

# to copy lists use .copy()

# pow(p, si, 1000000007) for modular exponentiation

# my_dict.pop('key', None)
# This will return my_dict[key] if key exists in the dictionary, and None otherwise.



# bin(int('010101', 2))