#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>

#define f first
#define s second
#define mp make_pair

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define rep(i,s,n) for(int i=(s); i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define IN(x,s,g) ((x) >= (s) && (x) < (g))
#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))
#define print(x) printf("%d\n",x)

using namespace std;

typedef unsigned int uint;
typedef long long ll;

const int _dx[] = {0,1,0,-1};
const int _dy[] = {-1,0,1,0};

int getInt(){
  int ret = 0,c;
  c = getchar();
  while(!isdigit(c)) c = getchar();
  while(isdigit(c)){
    ret *= 10;
    ret += c - '0';
    c = getchar();
  }
  return ret;
}

int memo[100][100];
int n;
int card[100];

#define ABS(x) ((x) < 0 ? -(x) : (x))

int solve(int a, int b){
  if(a == b) return 0;
  if(b == a + 1 || (b == n-1 && a == 0)) return ABS(card[b] - card[a]);
  if(memo[a][b] != -1) return memo[a][b];

  int ret = 0;
  int bb = b;
  if(a > b) bb = n + b;
  for(int c = a; c < bb; c++)
    ret = max(ret, solve(a, c%n) + solve((c+1)%n, b) + ABS(card[a] - card[(c+1)%n]));

  return memo[a][b] = ret;
}

int main(){
  int cc = getInt();
  while( cc --> 0 ){
    int ans = 0;
    n = getInt();
    REP(i,n) card[i] = getInt();
    memset(memo,-1,sizeof(memo));
    REP(i,n) ans = max(ans, solve(i, (i+n-1)%n));
    print(ans);
  }
  return 0;
}