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 java.io.*;
import java.util.*;

public class Main {

	static class ContestIO {
		
		PrintWriter out = new PrintWriter(System.out);
		BufferedReader reader;

		StringTokenizer tokenizer;

		ContestIO(Reader reader) {
			this.reader = new BufferedReader(reader);
		}

		static ContestIO get(){
			return new ContestIO(new InputStreamReader(System.in));
		}

		static ContestIO get(String file){
			try{
				return new ContestIO(new FileReader(file));
			} catch(IOException ex){
				return ContestIO.get();
			}
		}

		String readLine(){
			try {
				return reader.readLine();
			} catch (IOException e) {
				throw new RuntimeException("Couldn't read anything", e);
			}
		}

		String next(){
			while(tokenizer == null || ! tokenizer.hasMoreElements()){
				tokenizer = new StringTokenizer(readLine());
			}
			return tokenizer.nextToken();
		}

		int nextInt(){
			return Integer.parseInt(next());
		}

		long nextLong(){
			return Long.parseLong(next());
		}
	}


	public static void main(String[] args){
		ContestIO io = ContestIO.get("__input.txt");
		int cases = io.nextInt();
		while(cases -- > 0){
			int n = io.nextInt();
			long[] a = new long[n + 1];
			for(int i = 0; i < n; i++)
				a[i + 1] = io.nextLong();
			long[][] dp = new long[3][n + 1];
			dp[0][1] = dp[2][1] = a[1];
			for(int i = 2; i <= n; i++){
				dp[0][i] = dp[0][i - 1];
				dp[1][i] = max(dp[0][i - 2], dp[1][i - 2]);
				dp[2][i] = max(dp[0][i - 1], dp[1][i - 1], dp[2][i - 1]);
				if(i % 2 != 0){
					dp[0][i] += a[i];
					dp[1][i] += a[i - 1];
					dp[2][i] += a[i];
				} else{
					dp[1][i] += a[i];
				}
			}
			io.out.println(max(dp[0][n], dp[1][n], dp[2][n]));
		}
		io.out.close();
	}
	
	private static long max(long... A){
		long m = Long.MIN_VALUE;
		for(long i : A)
			m = m > i ? m : i;
		return m;
	}

}


