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
#include <bits/stdc++.h>
using namespace std;
template <typename st, typename nd>
string to_string(pair<st, nd> P);
string to_string(const string& Str) {
  string r;
  r += (char)34;
  r += Str;
  r += (char)34;
  return r;
}
string to_string(const bool& B) { return (B ? "true" : "false"); }
string to_string(const char& c) {
  string rs;
  return rs + (char)39 + c + (char)39;
}
string to_string(const char* Sr) { return to_string((string)Sr); }
template <size_t sz>
string to_string(const bitset<sz> Bs) {
  string r;
  for (size_t i = 0; i < sz; ++i) {
    r += static_cast<char>((int)Bs[i] + 48);
  }
  return r;
}
string to_string(const vector<int> V) {
  string r;
  r += 123;
  for (auto& el : V) {
    if (r.size() != 1) {
      r += ", ";
    }
    r += to_string(el);
  }
  r += 125;
  return r;
}
template <typename dimV>
string to_string(dimV vd) {
  string r;
  r += 123;
  for (auto& el : vd) {
    if (r.size() != 1) {
      r += ", ";
    }
    r += to_string(el);
  }
  r += 125;
  return r;
}
template <typename st, typename nd>
string to_string(pair<st, nd> P) {
  return "( " + to_string(P.first) + ", " + to_string(P.second) << ")";
}
void dbg() { cerr << endl; }
template <typename st, typename... en>
void dbg(st St, en... E) {
  cerr << "  " << to_string(St);
  dbg(E...);
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long arr[n];
    long long res = 0;
    for (long long i = 0; i < n; i++) {
      cin >> arr[i];
      res += arr[i] * (i % 2 == 0);
    }
    vector<long long> v1, v2;
    for (int i = 0; i + 1 < n; i += 2) v1.push_back(arr[i + 1] - arr[i]);
    for (int i = 1; i + 1 < n; i += 2) v2.push_back(arr[i] - arr[i + 1]);
    long long k = 0;
    long long ans = 0;
    for (int i = 0; i < v1.size(); i++) {
      k += v1[i];
      ans = max(ans, k);
      if (k < 0) k = 0;
    }
    k = 0;
    for (int i = 0; i < v2.size(); i++) {
      k += v2[i];
      ans = max(ans, k);
      37;
      if (k < 0) k = 0;
    }
    cout << res + ans << "\n";
  }
}
