#include <iostream>

 #include <algorithm>

 #include <cstring>

 #include <cstdio>

 #include <string>

 #include <map>

 #include <cmath>

 #include <vector>

 #define Faster ios::sync_with_stdio(false),cin.tie(0)

 #define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)

 #define Close fclose(stdin),fclose(stdout)

 const int maxn = ;

 using namespace std;

 const int MOD = 1e9+;

 #define INF 0xfffffff

 typedef long long ll;

 int a[maxn];

 int sum[maxn];

 int dp[maxn][maxn];    //i-j的最小花费

 int main(){

     Faster;

     int t;

     int cnt = ;

     scanf("%d", &t);

     while(t--){

         cnt++;

         int n;

         scanf("%d", &n);

         memset(sum, , sizeof(sum));

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

             scanf("%d", &a[i]);

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

         }

         memset(dp, , sizeof(dp));

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

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

                 dp[i][j] = INF;

             }

         }

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

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

                 int j = i+l;

                 for(int k = ;k <= j-i+;k++){

                     dp[i][j] = min(dp[i][j], dp[i+][i+k-]+dp[i+k][j]+k*(sum[j] - sum[i+k-])+a[i]*(k-));

                 }

             }

         }

         printf("Case #%d: %d\n", cnt, dp[][n]);

     }

     return ;

 }