#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd.next(1,n))
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define PB push_back
using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned ll;
using namespace std;const int N=1e3+5,M=210+5,K=2e3+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;
int n,m,k,x,y,z,A[N][3],f1[M][M],f2[M][M],f3[M][M],g1[M][M],g2[M][M],g3[M][M];
ll calc(int x){return x*(x-1)/2;}
void chk(int &x,int y){x<y&&(x=y);}
void Solve(){
	int i,j,h;scanf("%d",&n);for(i=1;i<=n;i++) scanf("%d%d%d",&A[i][0],&A[i][1],&A[i][2]);
	Me(f1,0);Me(f2,0);Me(f3,0);
	for(i=n;i;i--) {
		Mc(g1,f1);Mc(g2,f2);Mc(g3,f3);Me(f1,0);Me(f2,0);Me(f3,0);
		for(j=0;j<=min(n-i+1,210);j++){
			for(h=0;h<=min(n-i+1,210);h++){
				chk(f1[min(j+1,210)][min(h+1,210)],g1[j][h]+A[i][0]);
				if(j<210) chk(f2[1][min(h+1,210)],g1[j][h]+A[i][1]-calc(j+1));
				if(h<210) chk(f3[1][min(j+1,210)],g1[j][h]+A[i][2]-calc(h+1));
				if(j<210) chk(f1[1][min(h+1,210)],g2[j][h]+A[i][0]-calc(j+1));
				chk(f2[min(j+1,210)][min(h+1,210)],g2[j][h]+A[i][1]);
				if(h<210) chk(f3[min(j+1,210)][1],g2[j][h]+A[i][2]-calc(h+1));
				if(j<210) chk(f1[min(h+1,210)][1],g3[j][h]+A[i][0]-calc(j+1));
				if(h<210) chk(f2[min(j+1,210)][1],g3[j][h]+A[i][1]-calc(h+1));
				chk(f3[min(j+1,210)][min(h+1,210)],g3[j][h]+A[i][2]);
			}
		} 
	}
	int Ans=0;for(i=1;i<=210;i++) for(j=0;j<=210;j++) Ans=max(Ans,max(f1[i][j],max(f2[i][j],f3[i][j])));printf("%d\n",Ans); 
}
int main(){
	int t;scanf("%d",&t);while(t--) Solve();
}