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

public class Z_D{
	public static long mod= 1000000007;
	public static Debug db;
	public static boolean w=true;

	public static void main(String[] args) throws IOException {
		InputReader in = new InputReader(System.in);
		PrintWriter out = new PrintWriter(System.out);
		Autocompletion solver = new Autocompletion();
		db=new Debug(System.getSecurityManager()==null);
		solver.solve(1, in, out);
		out.close();
	}
	static class Autocompletion {

		public void solve(int testNumber, InputReader in, PrintWriter out) {
			int t1=in.nextInt();
			for(int z1=0;z1<t1;z1++) {
				int n=in.nextInt();
				int arr[]=in.nextIntArr(n);
				long ret=0;
				for(int i=0;i<n;i+=2) {
					ret+=(long)arr[i];//do i need long
				}
				long mx=0;
				int first[]=new int[n/2+1];
				int sec[]=new int[n/2+1];
				for(int i=0;i<n;i+=2) {
					if(i+1<n) {
						first[i/2]=arr[i+1]-arr[i];
					}
				}
				for(int i=2;i<n;i+=2) {
					sec[i/2]=arr[i-1]-arr[i];
				}
				db.debug("first", first);
				db.debug("second", sec);
				long cur=0;
				long cur2=0;
				for(int i=0;i<first.length;i++) {
					cur+=first[i];
					if(cur<0) {
						cur=0;
					}
					cur2+=sec[i];
					if(cur2<0) {
						cur2=0;
					}
					mx=Math.max(mx, cur);
					mx=Math.max(mx, cur2);
				}
				out.println(mx+ret);
			}
		}
	}
	static class Pair implements Comparable<Pair>{
		int x;
		int y;
		Pair(int a, int b){
			x=a;
			y=b;
		}
		@Override
		public int compareTo(Pair arg0) {
			if(arg0.x!=x)return x-arg0.x;
			return y-arg0.y;
		}
	}
	static class Triple implements Comparable<Triple>{
		int x;
		int y;
		int z;
		Triple(int a, int b, int c){
			x=a;
			y=b;
			z=c;
		}
		@Override
		public int compareTo(Triple arg0) {
			if(arg0.x!=x)return x-arg0.x;
			return y-arg0.y;
		}
	}

	static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
 
        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }
 
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
 
        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
        	return Long.parseLong(next());
        }
        public int[] nextIntArr(int n) {
        	int arr[]=new int[n];
        	for(int i=0;i<n;i++) {
        		arr[i]=this.nextInt();
        	}
        	return arr;
        }
    }
	public static class Debug {
        private boolean allowDebug;
 
        public Debug(boolean allowDebug) {
            this.allowDebug = allowDebug;
        }
 
        private void outputName(String name) {
            System.out.print(name + " = ");
        }
 
        public void debug(String name, int x) {
            if (!allowDebug) {
                return;
            }
 
            outputName(name);
            System.out.println("" + x);
        }
 
        public void debug(String name, long x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            System.out.println("" + x);
        }
 
        public void debug(String name, double x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            System.out.println("" + x);
        }
 
        public void debug(String name, int[] x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            System.out.println(Arrays.toString(x));
        }
 
        public void debug(String name, long[] x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            System.out.println(Arrays.toString(x));
        }
 
        public void debug(String name, double[] x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            System.out.println(Arrays.toString(x));
        }
        
        public void debug(String name, Pair[] x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            StringBuilder sb = new StringBuilder("[");
            int cnt=0;
            for(Pair y:x) {
            	sb.append("("+y.x+","+y.y+')');
            	if (cnt != x.length-1)sb.append(", ");
            	cnt++;
            }
            System.out.println(sb.append("]").toString());
        }
 
        public void debug(String name, Object x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            System.out.println("" + x);
        }
 
        public void debug(String name, Object... x) {
            if (!allowDebug) {
                return;
            }
            outputName(name);
            System.out.println(Arrays.deepToString(x));
        }
    }
}
