#include<bits/stdc++.h>
#define int long long
using namespace std;
const int inf=1e18,mod=998244353;
void O_o()
{
	int n;
	cin>>n;
	int N=min(205ll,n);
	vector<array<int,3>> a(n+1);
	for(int i=1; i<=n; i++)
	{
		cin>>a[i][0]>>a[i][1]>>a[i][2];
	}
	vector dp1(N+2,vector<int>(N+2)),dp2(N+2,vector<int>(N+2)),dp3(N+2,vector<int>(N+2));
	for(int i=1; i<=n; i++)
	{
		vector dpn1(N+2,vector<int>(N+2)),dpn2(N+2,vector<int>(N+2)),dpn3(N+2,vector<int>(N+2));
		for(int j=0; j<=N; j++)
		{
			for(int k=0; k<=N; k++)
			{
				int nj=j>0?(j+1):0,nk=k>0?(k+1):0;
				int j1=(i>1),k1=(i>1);
				
				dpn1[nj][nk]=max(dpn1[nj][nk],dp1[j][k] + a[i][0] - nj - nk);
				dpn1[j1][nk]=max(dpn1[j1][nk],dp2[j][k] + a[i][0] - nk - k1);
				dpn1[nj][k1]=max(dpn1[nj][k1],dp3[j][k] + a[i][0] - nj - j1);
				
				dpn2[nj][nk]=max(dpn2[nj][nk],dp2[j][k] + a[i][1] - nj - nk);
				dpn2[j1][nk]=max(dpn2[j1][nk],dp1[j][k] + a[i][1] - nk - k1);
				dpn2[nj][k1]=max(dpn2[nj][k1],dp3[j][k] + a[i][1] - nj - j1);
				
				dpn3[nj][nk]=max(dpn3[nj][nk],dp3[j][k] + a[i][2] - nj - nk);
				dpn3[j1][nk]=max(dpn3[j1][nk],dp1[j][k] + a[i][2] - nk - k1);
				dpn3[nj][k1]=max(dpn3[nj][k1],dp2[j][k] + a[i][2] - nj - j1);
			}
		}
		dp1=dpn1;
		dp2=dpn2;
		dp3=dpn3;
	}
	int ans=0;
	for(int i=0; i<=N; i++)
	{
		for(int j=0; j<=N; j++)
		{
			ans=max(ans,dp1[i][j]);
			ans=max(ans,dp2[i][j]);
			ans=max(ans,dp3[i][j]);
		}
	}
	cout<<ans<<"\n";
}
signed main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cout<<fixed<<setprecision(12);
	int T=1;
	cin>>T;
	while(T--)
	{
		O_o();
	}
}
// dp1[i][j][k] + a[i][0] - nj - nk -> dp1[i+1][nj][nk]
// dp2[i][j][k] + a[i][0] - nk - 1 -> dp1[i+1][j1][nk]
// dp3[i][j][k] + a[i][0] - nj - 1 -> dp1[i+1][nj][k1]