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

const int N = 1005, L = 200, INF = 1e9;

int n;
int a[N][3];
int f[2][3][N+5][N+5];

void upd (int &x, int y) {
    if (y>x) x = y;
}

void solve () {
    cin >> n;
    for (int i=1; i<=n; i++)
        cin >> a[i][0] >> a[i][1] >> a[i][2];
    memset (f, -0x3f, sizeof(f));
    int ans=0;
    f[1][0][0][0] = f[1][1][0][0] = f[1][2][0][0] = 0;
    for (int i=1; i<=n+1; i++) {
        for (int id=0; id<3; id++) {
            for (int j=0; j<=i && j<=L; j++) {
                for (int k=0; k<=i && k<=L; k++) { 
                    if (j != i-1)
                        f[i&1][id][j][k] -= j;
                    if (k != i-1)
                        f[i&1][id][j][k] -= k;
                    if (i == n+1) {
                        upd (ans, f[i&1][id][j][k]);
                        continue;
                    }
                    upd (f[i+1&1][id][j+1][k+1], f[i&1][id][j][k]+a[i][id]);
                    upd (f[i+1&1][(id+1)%3][k+1][1], f[i&1][id][j][k]+a[i][(id+1)%3]);
                    upd (f[i+1&1][(id+2)%3][1][j+1], f[i&1][id][j][k]+a[i][(id+2)%3]);
                    f[i&1][id][j][k] = -INF;
                }
            }
        }
    }
    cout << ans << '\n';
}

int main () {
    ios::sync_with_stdio(false);
    int t; cin >> t; while (t --) solve ();
}