#include <bits/stdc++.h>

using namespace std;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using f64 = double;

const int B = 200;
constexpr i64 inf = 1E18;

template <class T> void chmax(T &a, T b) { a = max(a, b); }

void solve() {
    int n;
    cin >> n;

    vector<array<int, 3>> a(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 3; j++) {
            cin >> a[i][j];
        }
    }

    int m = B;
    vector dpx(2, vector(m + 1, vector(m + 1, -inf)));
    vector dpy(m + 1, vector(2, vector(m + 1, -inf)));
    vector dpz(m + 1, vector(m + 1, vector(2, -inf)));
    dpx[0][0][0] = dpy[0][0][0] = dpz[0][0][0] = 0;
    for (int i = 0; i < n; i++) {
        vector ndpx(2, vector(m + 1, vector(m + 1, -inf)));
        vector ndpy(m + 1, vector(2, vector(m + 1, -inf)));
        vector ndpz(m + 1, vector(m + 1, vector(2, -inf)));
        ndpx[0][0][0] = ndpy[0][0][0] = ndpz[0][0][0] = 0;
        for (int x = 0; x < 2; x++) {
            for (int y = 0; y <= m; y++) {
                for (int z = 0; z <= m; z++) {
                    int nx = x + (x != 0);
                    int ny = y + (y != 0);
                    int nz = z + (z != 0);
                    if (ny <= m && nz <= m) {
                        chmax(ndpx[1][ny][nz], dpx[x][y][z] + a[i][0] - y - z);
                    }
                    if (nx <= m && nz <= m) {
                        chmax(ndpy[nx][1][nz], dpx[x][y][z] + a[i][1] - x - z);
                    }
                    if (nx <= m && ny <= m) {
                        chmax(ndpz[nx][ny][1], dpx[x][y][z] + a[i][2] - x - y);
                    }
                }
            }
        }
        for (int x = 0; x <= m; x++) {
            for (int y = 0; y < 2; y++) {
                for (int z = 0; z <= m; z++) {
                    int nx = x + (x != 0);
                    int ny = y + (y != 0);
                    int nz = z + (z != 0);
                    if (ny <= m && nz <= m) {
                        chmax(ndpx[1][ny][nz], dpy[x][y][z] + a[i][0] - y - z);
                    }
                    if (nx <= m && nz <= m) {
                        chmax(ndpy[nx][1][nz], dpy[x][y][z] + a[i][1] - x - z);
                    }
                    if (nx <= m && ny <= m) {
                        chmax(ndpz[nx][ny][1], dpy[x][y][z] + a[i][2] - x - y);
                    }
                }
            }
        }
        for (int x = 0; x <= m; x++) {
            for (int y = 0; y <= m; y++) {
                for (int z = 0; z < 2; z++) {
                    int nx = x + (x != 0);
                    int ny = y + (y != 0);
                    int nz = z + (z != 0);
                    if (ny <= m && nz <= m) {
                        chmax(ndpx[1][ny][nz], dpz[x][y][z] + a[i][0] - y - z);
                    }
                    if (nx <= m && nz <= m) {
                        chmax(ndpy[nx][1][nz], dpz[x][y][z] + a[i][1] - x - z);
                    }
                    if (nx <= m && ny <= m) {
                        chmax(ndpz[nx][ny][1], dpz[x][y][z] + a[i][2] - x - y);
                    }
                }
            }
        }
        for (int x = 0; x < 2; x++) {
            for (int y = 0; y < 2; y++) {
                for (int z = 0; z < 2; z++) {
                    i64 res = 0;
                    chmax(res, ndpx[x][y][z]);
                    chmax(res, ndpy[x][y][z]);
                    chmax(res, ndpz[x][y][z]);
                    chmax(ndpx[x][y][z], res);
                    chmax(ndpy[x][y][z], res);
                    chmax(ndpz[x][y][z], res);
                }
            }
        }
        dpx = move(ndpx);
        dpy = move(ndpy);
        dpz = move(ndpz);
    }

    i64 ans = 0;
    for (int x = 0; x < 2; x++) {
        for (int y = 0; y <= m; y++) {
            for (int z = 0; z <= m; z++) {
                chmax(ans, dpx[x][y][z]);
            }
        }
    }
    for (int x = 0; x <= m; x++) {
        for (int y = 0; y < 2; y++) {
            for (int z = 0; z <= m; z++) {
                chmax(ans, dpy[x][y][z]);
            }
        }
    }
    for (int x = 0; x <= m; x++) {
        for (int y = 0; y <= m; y++) {
            for (int z = 0; z < 2; z++) {
                chmax(ans, dpz[x][y][z]);
            }
        }
    }
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(16);

    int t = 1;
    cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}