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; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	T = int(input())
	for _ in range(T):
		N = int(input())
		A = getlist()
		Arev = list(reversed(A))
		M = int(N // 2)

		if N == 1:
			print(A[0])
			continue

		#移動する前の偶数番目の合計
		anspre = sum(A)
		for i in range(M):
			anspre -= A[2 * i + 1]

		S = [0] * (M + 1)
		minval = 0
		valmax = 0
		for i in range(M):
			S[i + 1] = A[2 * i + 1] - A[2 * i]

		for i in range(M):
			S[i + 1] += S[i]
			minval = min(S[i + 1], minval)
			valmax = max(S[i + 1] - minval, valmax)


		M2 = int((N - 1) // 2)
		S2 = [0] * (M2 + 1)
		minval2 = 0
		valmax2 = 0
		for i in range(M2):
			S2[i + 1] = A[2 * i + 1] - A[2 * i + 2]

		for i in range(M2):
			S2[i + 1] += S2[i]
			minval2 = min(S2[i + 1], minval2)
			valmax2 = max(S2[i + 1] - minval2, valmax2)

		# print(S2)
		# print(anspre, valmax, valmax2)
		ans = anspre + max(valmax, valmax2)
		print(ans)


if __name__ == '__main__':
	main()