#include <bits/stdc++.h>
 
using namespace std;

int main(void) 
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  int tc;

  cin >> tc;

  while(tc--)
  {
    int n,t;
    cin >> n;
    vector <long long int> v;
    long long int res = 0;

    for(int i=0;i<n;i++)
    {
      cin >> t;
      v.push_back(t);
    }

    for(int i=0;i<3;i++)
    {
      vector <long long int> dp(n+1,-1);
      dp[0] = 0;

      for(int i=0;i<n;i++)
      {
        dp[i+1] = max(dp[i+1],dp[i]);
        if(i+2 < n)
        {
          if((v[i]==v[i+1]) || (v[i]==v[i+2]) || (v[i+1]==v[i+2]))
          {
            continue;
          }
          dp[i+3] = max(dp[i+3],dp[i] + v[i]);
        }
      }

      res = max(res,dp[n]);
      long long int temp = v[0];
      v.erase(v.begin());
      v.push_back(temp);
    }
    cout << res << '\n';
  }
  return 0;
}