#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 #define inf 1<<30

 #define FILL(a,b) memset(a,b,sizeof(a))

 int dp[][],sum[];

 int n,x;

 int dfs(int l,int r)

 {

     if(dp[l][r]!=-inf)return dp[l][r];

     int ans=sum[r]-sum[l-];

     for(int k=l;k<=r;k++){

         ans=max(ans,sum[k]-sum[l-]-dfs(k+,r));//取左边的

         ans=max(ans,sum[r]-sum[k-]-dfs(l,k-));//取右边的

     }

     return dp[l][r]=ans;

 }

 int main()

 {

     int _case,t=;

     scanf("%d",&_case);

     while(_case--){

         scanf("%d",&n);

         FILL(sum,);

         for(int i=;i<=n;i++)

             for(int j=;j<=n;j++)dp[i][j]=-inf;

         for(int i=;i<=n;i++){

             scanf("%d",&x);

             dp[i][i]=x;

             sum[i]=sum[i-]+x;

         }

         printf("Case %d: %d\n",t++,dfs(,n));

     }

     return ;

 }