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.*;
import java.util.Map.Entry;
import java.util.concurrent.atomic.AtomicBoolean;
import java.util.stream.Collectors;

public class Main {

    static boolean check(int s, boolean isOdd) {
        int l = 0;
        boolean checking = isOdd;
        for (int i = 1; i <= n; i++) {
            if (!checking) {
                l++;
                checking = true;
            } else {
                if (a[i] <= s) {
                    l++;
                    checking = false;
                }
            }
        }
        return l >= k;
    }

    static int bs(int low, int high) {
        while(low < high) {
            int mid = (low + high) / 2;
            if (check(mid, true) || check(mid, false)) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }
        return low;
    }

    static int t;
    static int n;
    static int k;
    static int[] a;
    static Integer[] A;
    static long[] l;
    static Long[] L;
    static int[] w;
    static String s;
    static String s2;
    static int c;
    static int c2;
    static long ans;
    static String anss;
    static char[] cs;

    public static void main(String[] args) {
        MyScanner sc = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));

        // Start writing your solution here. -------------------------------------

        t = sc.nextInt();
        while(t-- > 0) {
            n = sc.nextInt();
            l = new long[n];
            ans = 0;
            long m = 0;
            long tc = 0;
            long tl = 0;
            for (int i = 0; i < n; i++) {
                l[i] = sc.nextInt();
                if (i % 2 == 0) {
                    ans += l[i];
                }
                if (i >= 1) {
                    if (i % 2 == 1) {
                        tc = Math.max(0, tc + (l[i] - l[i - 1]));
                        m = Math.max(m, tc);
                    } else {
                        tl = Math.max(0, tl + (l[i - 1] - l[i]));
                        m = Math.max(m, tl);
                    }
                }
            }
            out.println(ans + m);
        }

        // Stop writing your solution here. -------------------------------------
        out.close();
    }

    static int countMatches(String s, char c) {
        return s.length() - s.replaceAll(String.valueOf(c), "").length();
    }


    //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;

    //-----------MyScanner class for faster input----------
    public static class MyScanner {

        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }
    //--------------------------------------------------------
}