LOJ 1004

#include<bits/stdc++.h>
using namespace std;

typedef unsigned long long int  ull;
typedef long long int      ll;
typedef vector<int>        vi;
typedef vector<ll>         vll;
typedef vector<vi>         vvi;
typedef pair<int,int >     pii;
typedef vector< pii >      vpii;
typedef set<int>           sti;

#define sc                 scanf
#define pf                 printf
#define sci(n)             scanf("%d",&n)
#define scii(n,m)          scanf("%d %d",&n,&m)
#define scl(n)             scanf("%lld",&n)
#define scd(n)             scanf("%lf",&n)
#define scs(s)             scanf("%s",s)
#define pfi(n)             printf("%d",n)
#define pfl(n)             printf("%lld",n)
#define pff(n)             cout<<n
#define line               printf("\n")
#define spc                printf(" ")
#define loop(i,x,y)        for(int i=int(x); i<=int(y); i++)
#define rloop(i,y,x)       for(int i=int(y); i>=int(x); i--)
#define cspf(i)            printf("Case %d: ", i)
#define vout(v)            for(int w=0;w<v.size();w++){if(w) cout<<' '; cout<<v[w];}
#define pb                 push_back
#define mp                 make_pair
#define ff                 first
#define ss                 second
#define all(v)             v.begin(),v.end()
#define rall(v)            v.rbegin(),v.rend()
#define read()             freopen("input.txt", "r", stdin)
#define write()            freopen("output.txt", "w", stdout)
#define fastIO()           ios_base::sync_with_stdio(false); cin.tie(NULL);
/// Constants
#define eps                1e-9
#define PI                 acos(-1.0)  // 3.1415926535897932
#define MAX                1000009

int a[202][102],cnt[202][102];

int dpsolve(int i,int j,int n)
{
	if(cnt[i][j]!=-1) return cnt[i][j];
	if(a[i][j]==-1) return a[i][j];
	if(i==(n*2)-1) return a[i][j];
	if(i<n) return cnt[i][j] = a[i][j] + max(dpsolve(i+1,j,n),dpsolve(i+1,j+1,n));
	else return cnt[i][j] = a[i][j] + max(dpsolve(i+1,j-1,n),dpsolve(i+1,j,n));
}

int main()
{
	//read();
	//write();
	int t;
	sci(t);
	loop(i,1,t){
		int n;
		sci(n);
		int x=1;
		memset(cnt,-1,sizeof(cnt));
		memset(a,-1,sizeof(a));
		loop(j,1,(n*2)-1){
			loop(k,1,x){
				sci(a[j][k]);
			}
			if(j<n) x++;
			else x--;
		}
		int mx = dpsolve(1,1,n);
		cspf(i);pfi(mx);line;
	}
	return 0;
}