11158

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
int brt(int*A,int N){
    sort(A,A+N);
    int S=0,B=0;
    do{
        S=0;
        F(N-1)S+=abs(A[i]-A[i+1]);
        B=max(B,S);
    }while(next_permutation(A,A+N));
    return B;
}
#define MX (55)
#define DV (10000)
#define TEMP 1e5
#define CRT .99995
#define PRC (4)
int nxt(int*A,int N,int&I){
    I=rand()%(N-1);
    int S=0;
    if(I)S-=abs(A[I]-A[I-1]);
    if(I<N-2)S-=abs(A[I+1]-A[I+2]);
    swap(A[I],A[I+1]);
    if(I)S+=abs(A[I]-A[I-1]);
    if(I<N-2)S+=abs(A[I+1]-A[I+2]);
    return S;
}
int solANL(int*A,int N){
    if(N<11)return brt(A,N);
    double T=TEMP,d,c=CRT,a=1e-5;
    int S=0,C=0,B,I;
    random_shuffle(A,A+N);
    F(N-1)C-=abs(A[i]-A[i+1]);
    while(T>a){
        B=C-nxt(A,N,I);
        d=B-C;
        if(d<0||exp(-d/T)>(rand()%DV*1./DV))
            S=min(S,C=B);
        else swap(A[I],A[I+1]);
        T*=c;
    }
    return -S;
}
int main(void){
    int N,A[MX];
    srand(time(0));
    IN(_)F(_){
        scanf("%d",&N),ga(N,A);
        printf("Case %d: %d\n",i+1,solANL(A,N));
    }
    return 0;
}