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
# ------------------- fast io --------------------
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")
 
# ------------------- fast io --------------------
def maxeven(arr, n): 
  
    # There has to be at 
    # least 2 elements 
    if (n < 2): 
        return 0
  
    # dp[i] will store the maximum 
    # subarray sum of even length 
    # starting at arr[i] 
    dp = [0 for i in range(n)] 
  
    # Valid subarray cannot start from 
    # the last element as its 
    # length has to be even 
    dp[n - 1] = 0
    dp[n - 2] = arr[n - 2] + arr[n - 1] 
  
    for i in range(n - 3, -1, -1): 
  
        # arr[i] and arr[i + 1] can be added 
        # to get an even length subarray 
        # starting at arr[i] 
        dp[i] = arr[i] + arr[i + 1] 
  
        # If the sum of the valid subarray  
        # starting from arr[i + 2] is  
        # greater than 0 then it can be added  
        # with arr[i] and arr[i + 1] 
        # to maximize the sum of the  
        # subarray starting from arr[i] 
        if (dp[i + 2] > 0): 
            dp[i] += dp[i + 2] 
  
    # Get the sum of the even length 
    # subarray with maximum sum 
    maxSum = max(dp) 
    return maxSum 

testcases=int(input())

for j in range(testcases):
    n=int(input())
    vals=list(map(int,input().split()))
    temp=vals.copy()
    for s in range(n):
        if s%2==0:
            temp[s]=-temp[s]
    add=maxeven(temp,n)
    ans=0
    for s in range(0,n,2):
        ans+=vals[s]
    if add>0:
        print(ans+add)
    else:
        print(ans)