#include<cstdio>

 #include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cmath>

 #include<queue>

 #include<map>

 using namespace std;

 #define MOD 1000000007

 const int INF=0x3f3f3f3f;

 const double eps=1e-;

 typedef long long ll;

 #define cl(a) memset(a,0,sizeof(a))

 #define ts printf("*****\n");

 const int MAXN=;

 int n,m,tt;

 int a[MAXN],b[MAXN],dp[MAXN][MAXN];

 int main()

 {

     int i,j,k;

     #ifndef ONLINE_JUDGE

     freopen("1.in","r",stdin);

     #endif

     scanf("%d",&tt);

     int ca=;

     while(tt--)

     {

         scanf("%d",&n);

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

         {

             scanf("%d",a+i);

         }

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

         {

             scanf("%d",b+i);

         }

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

         {

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

             {

                 j=i+d;

                 dp[i][j]=INF;

                 for(k=i;k<=j;k++)

                 {

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

                 }

             }

         }

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

     }

 }