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())
def rec(mn,ind,l,b,dp):
	if(ind==0):
		return 0
	else:
		if(dp[ind-1]==0):
			if(mn[ind-1][0]<l and mn[ind-1][1]<b):
				dp[ind-1]=max(rec(mn,ind-1,l,b,dp),mn[ind-1][2]+rec(mn,ind-1,mn[ind-1][0],mn[ind-1][1],dp))
			else:
				dp[ind-1]=rec(mn,ind-1,l,b,dp)
		return dp[ind-1]
for _ in range(t):
	# a=int(input())
	n=int(input())
	l=list(map(int,input().split()))
	sm=0
	mx=0
	for i in range(0,len(l)-1,2):
		# print(i)
		sm+=l[i+1]-l[i]
		mx=max(sm,mx)
			# end=i
		if(sm<0):
			sm=0
			# start=i
			# end=i
	sm1=0
	mx1=0
	for i in range(1,len(l)-1,2):
		# print(i)
		sm1+=l[i]-l[i+1]
		mx1=max(sm1,mx1)
			# end=i
		if(sm1<0):
			sm1=0
			# start=i
			# end=i
	# print(sum(l[::2]),mx,mx1)
	print(sum(l[::2])+max(mx,mx1))

		