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.BufferedReader;
											import java.io.FileReader;
											import java.io.IOException;
											import java.io.InputStreamReader;
											import java.io.PrintWriter;
									import java.lang.reflect.Array;
									import java.math.BigInteger;
											import java.util.*;
								
												  public class Codeforces{
						
						
													    void pre() throws Exception{}
													   
													    void solve(int TC) throws Exception{ 
													    int t=ni();
													    while(t--!=0) {
													    	int n=ni();
													    	long a[]=new long[n];
													    	long total=0;
													    	for(int i=0;i<n;i++) {a[i]=nl();
													    	if(i%2==0)total+=a[i];
													    	}
													    	long b[]=new long[n/2+1];
													    	int in=0;
													    	if(n==1)pn(a[0]);
													    	else {
													    	for(int i=1;i<n;i+=2) {
													    		b[in]=a[i]-a[i-1];
													    		in++;
													    		}
													    	long c[]=new long[n/2+1];
													    	in=0;
													    	for(int i=2;i<n;i+=2) {
													    		c[in]=a[i-1]-a[i];
													    		in++;
													    		}
													    	long max1=maxSubArraySum(b);
													    	long max2=maxSubArraySum(c);
													    	long max=Math.max(max1,max2);
													    	pn(total+max);
													    	
													    	
													    	
													    	}
													    }
													    }
													    static long maxSubArraySum(long a[]) 
													    { 
													    	long size = a.length; 
													        long max_so_far = Long.MIN_VALUE, max_ending_here = 0; 
													  
													        for (int i = 0; i < size; i++) 
													        { 
													            max_ending_here = max_ending_here + a[i]; 
													            if (max_so_far < max_ending_here) 
													                max_so_far = max_ending_here; 
													            if (max_ending_here < 0) 
													                max_ending_here = 0; 
													        } 
													        return max_so_far; 
													    } 
													    			
													    	
													    	
													    	
													    	
													    	
													    	
													    	
													    	
													    	
													    	
													    	
													    	
													    	
													    	
													    	
													    	
													    
		//											    	//Queue<Integer> q=new LinkedList();
		//											    	for(int i=0;i<s.length();i++) {
		//											    		if(s.charAt(i)=='1')
		//											    			q.add(1);
		//											    		else q.add(0);
		//											    	}
		//											    	while(1!=0) {
		//											    		int x=q.remove();
													    	
													    
												  
													    			
													    
													    
													    	
													    		
													    		
													    		
													    		
													    		
													    	
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
													    
				//									    class TrieNode{
													    
				//									    	TrieNode[] children=new TrieNode[26];
				//									    	boolean isEnd;
				//									    	TrieNode() {
				//									    		isEnd=false;
				//									    		for(int i=0;i<26;i++)
				//									    			children[i]=null;
				//									    	}
				//									    }
				//									    
				//									    static TrieNode root;
				//									    
				//									    void insert(String s) {
				//									    	TrieNode pCrawl=root;
				//									    	int index=0;
				//									    	int len=s.length();
				//									    	for(int i=0;i<len;i++) {
				//									    		index=s.charAt(i)-'a';
				//									    		if(pCrawl.children[index]!=null)
				//									    		pCrawl.children[index]=new TrieNode();
				//									            pCrawl = pCrawl.children[index]; 
				//
				//									    	}
				//									        pCrawl.isEnd= true; 
				//
				//									    }
													    
													    
													    
													    
													    
													  
													    
													    
						
													    				
													    
									
													    static boolean multipleTC = false, memory = false;
													    FastReader in;PrintWriter out;
													    void run() throws Exception{
													        in = new FastReader();
													        out = new PrintWriter(System.out);
													        int T = (multipleTC)?ni():1;
													        pre();for(int t = 1; t<= T; t++)solve(t);
													        out.flush();
													        out.close();
													    }
													    public static void main(String[] args) throws Exception{
													        if(memory)new Thread(null, new Runnable() {public void run(){try{new Codeforces().run();}catch(Exception e){e.printStackTrace();}}}, "1", 1 << 28).start();
													        else new Codeforces().run();
													    }
													    void p(Object o){out.print(o);}
													    void pn(Object o){out.println(o);}
													    void nd(Object o){out.println(o);}
													    void pni(Object o){out.println(o);out.flush();}
													    String n()throws Exception{return in.next();}
													    String nln()throws Exception{return in.nextLine();}
													    int ni()throws Exception{return Integer.parseInt(in.next());}
													    long nl()throws Exception{return Long.parseLong(in.next());}
													    double nd()throws Exception{return Double.parseDouble(in.next());}
													    
													    class FastReader{
													        BufferedReader br;
													        StringTokenizer st;
													        public FastReader(){
													            br = new BufferedReader(new InputStreamReader(System.in));
													        }
													
													        public FastReader(String s) throws Exception{
													            br = new BufferedReader(new FileReader(s));
													        }
													
													        String next() throws Exception{
													            while (st == null || !st.hasMoreElements()){
													                try{
													                    st = new StringTokenizer(br.readLine());
													                }catch (IOException  e){
													                    throw new Exception(e.toString());
													                }
													            }
													            return st.nextToken();
													        }
													
													        String nextLine() throws Exception{
													            String str = "";
													            try{   
														                str = br.readLine();
														            }catch (IOException e){
													                throw new Exception(e.toString());
													            }  
													            return str;
													        }
													    }
													}
				