#include<bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define repp(i,j,k) for(int i=j;i>=k;i--)
#define ls(x) (x<<1)
#define rs(x) ((x<<1)|1)
#define mp make_pair
#define sec second
#define fir first
#define pii pair<int,int>
#define lowbit(i) i&-i
#define int long long
#define double long double
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N=1005,M=1e6+5,S=(1<<15)+5,inf=(ll)1e18+7,mo=998244353;
const double eps=1e-8;
void read(int &p){
	int x=0,w=1;
	char ch=0;
	while(!isdigit(ch)){
		if(ch=='-')w=-1;
		ch=getchar();
	}
	while(isdigit(ch)){
		x=(x<<1)+(x<<3)+ch-'0';
		ch=getchar();
	}
	p=x*w;
}
int T;
int n,a[N][3];
int f[N][105][105][3];
void getmax(int &x,int v){
    x=max(x,v);
}
void solve(){
    read(n);
    int maxn=0;
    rep(i,1,n){
        rep(j,0,2)
            read(a[i][j]),maxn=max(maxn,a[i][j]);
    }
    int upp=ceil(sqrt(maxn));
    rep(i,0,n){
        rep(j,0,upp){
            rep(k,0,upp){
                rep(l,0,2)
                    f[i][j][k][l]=-inf;
            }
        }
    }
    f[0][0][0][1]=0;
    rep(i,0,n-1){
        rep(j,0,upp){
            rep(k,0,upp){
                rep(l,0,2){
                    if(f[i][j][k][l]<0)continue;
                    int trans[3];
                    trans[l]=(!i?0:1),trans[(l+1)%3]=j,trans[(l+2)%3]=k;
                    if(j)trans[(l+1)%3]++;
                    if(k)trans[(l+2)%3]++;//j,k 是 0 说明这个还没被选过
                    rep(x,0,2)
                        getmax(f[i+1][trans[(x+1)%3]][trans[(x+2)%3]][x],f[i][j][k][l]+a[i+1][x]-trans[(x+1)%3]-trans[(x+2)%3]);
                }
            }
        }
    }
    int ans=0;
    rep(j,0,upp){
        rep(k,0,upp){
            rep(l,0,2)
                ans=max(ans,f[n][j][k][l]);
        }
    }
    printf("%lld\n",ans);
}
signed main(){
    read(T);
    while(T--)
        solve();
    return 0;
}