Monkey Banana Problem

//Bismillahir Rahmanir Rahim
/******Harun Or Rashid******/
/***********Template Starts Here***********/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cctype>
#include<cstdlib>
#include<cassert>
#include<string>
#include<vector>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;

#define MEM(a,b) memset(a,b,sizeof(a))
#define CLR(a) memset(a,0,sizeof(a))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)>(b)?(b):(a))
#define ABS(a) ((a)>0? (a):(-(a)))
#define SQ(a) ((a)*(a))
#define SZ(a) (int)a.size()
#define FORN(i,n) for(i=1;i<=n;i++)
#define FORAB(i,a,b) for(i=a;i<=b;i++)
#define ALL(V) V.begin(),V.end()
#define pb(a) push_back(a)
#define pr(a) cout<<a<<endl
#define SQR(a) ((a)*(a))
#define pf printf
#define sf scanf
#define swap(a,b) (a ^= b, b ^= a, a ^= b)
#define PI acos(-1)
#define x first
#define y second
#define eps 1e-7

typedef int D;
typedef long long int LLD;
typedef unsigned long long int LLU;
typedef vector<D> VI;
typedef set<D> SI;
typedef vector<D>::iterator Viti;

/***********Template Ends Here***********/
int n,dp[100][100];
void init()
{
    memset(dp,0,sizeof dp);
}
void takeInput()
{
    int i,j;
    for(i=1; i<=n; i++)
        for(j=1; j<=i; j++)
            scanf("%d",&dp[i][j]);
    for(i=1; i<n; i++)
        for(j=1; j<=n-i; j++)
            scanf("%d",&dp[n+i][j]);
}
int solve()
{
    int i,j;
    for(i=1; i<=n; i++)
        for(j=1; j<=i; j++)
            dp[i][j]+=MAX(dp[i-1][j-1],dp[i-1][j]);
    for(i=1; i<n; i++)
        for(j=1; j<=n-i; j++)
            dp[n+i][j]+=MAX(dp[n+i-1][j],dp[n+i-1][j+1]);
    return dp[n+n-1][1];
}
int main()
{
    int T,i,answer;
    scanf("%d",&T);
    for(i=1; i<=T; i++)
    {
        scanf("%d",&n);
        init();
        takeInput();
        answer=solve();
        printf("Case %d: %d\n",i,answer);
    }
    return 0;
}