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 collections import Counter
import os
import sys
from io import BytesIO, IOBase

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
##########################################################
def dice():
    dp = [0] * (n + 1)
    dp[1] = 1
    dp[0] = 1
    for i in range(2, n + 1):
        for j in range(1, 7):
            if i - j >= 0:
                dp[i] = (dp[i] + dp[i - j]) % (10 ** 9 + 7)
            else:
                break


#for _ in range(int(input())):
#import math
import sys
# from collections import deque
#from collections import Counter
# ls=list(map(int,input().split()))
# for i in range(m):
# for i in range(int(input())):
#n,k= map(int, input().split())
#arr=list(map(int,input().split()))
#n=sys.stdin.readline()
#n=int(n)
# n = int(inaput())
#sys.setrecursionlimit(10 **8)
def shut():
    import os

    shutdown = input()

    if shutdown == 'no':
        exit()
    else:
        os.system("shutdown /s /t 1")


def cost(l,r,ch,s):
    var=0
    for i in range(l,r):
        if s[i]!=ch:
            var+=1
    return var
def fxn(l,r,ch,s):
    if l+1==r:
        if s[l]==ch:
            return 0
        return 1
    mid=(l+r)//2
    return min(cost(l,mid,ch,s)+fxn(mid,r,chr(ord(ch)+1),s),fxn(l,mid,chr(ord(ch)+1),s)+cost(mid,r,ch,s))
'''for _ in range(int(input())):
    n = int(input())
    s=input()
    s=s
    ans=fxn(0,n,"a",s)
    print(ans)''"



import heapq
import  sys
from math import gcd
n=int(input())
b,w=map(int,input().split())
heap=[]
heap1=[]
for _ in range(n-1):
    ba,w=map(int,input().split())
    if ba>b:
        heap.append(w-ba+1)
    else:
        heap1.append((-1*ba,w))
heapq.heapify(heap)
heapq.heapify(heap1)
ans=len(heap)+1
while heap:
    need=heap[0]
    if need>b:
        break
    b-=need
    heapq.heappop(heap)
    while heap1 and -1*heap1[0][0]>b:
        t,w=heapq.heappop(heap1)
        t=-1*t
        w=w
        heapq.heappush(heap,w+1-t)
    ans=min(ans,len(heap)+1)
print(ans)'''

for _ in range(int(input())):
    n=int(input())
    arr=list(map(int,input().split()))
    even=0
    for i in range(0,n,2):
        even+=arr[i]
    ans=0
    i=0
    sum=0
    while i<n-1:
        sum = sum+arr[i + 1] - arr[i]
        if sum<0:
            sum=0
        ans=max(ans,sum)
        i+=2
    sum=0
    j=1
    while j<n-1:
        sum=sum+arr[j]-arr[j+1]
        ans=max(ans,sum)
        if sum<0:
            sum=0
        j+=2
    print(even+ans)

