#include <stdio.h>

 #include <algorithm>

 #include <string.h>

 using namespace std;

 const int N =  + ;

 const int inf = 0x3f3f3f3f;

 int n;

 int a[N],b[N];

 int dp[N][N];

 int main()

 {

     int T;scanf("%d",&T);

     for(int kase=;kase<=T;kase++)

     {

         scanf("%d",&n);

         memset(a,,sizeof(a));

         memset(b,,sizeof(b));

         for(int i=;i<=n;i++) scanf("%d",a+i);

         for(int i=;i<=n;i++) scanf("%d",b+i);

         memset(dp,inf,sizeof(dp));

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

         {

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

             {

                 int j = i + len;

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

                 {

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

                 }

             }

         }

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

     }

 }