#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>

using namespace std;

#define lep(i, l, r) for(int i = (l); i <= (r); i ++)
#define rep(i, l, r) for(int i = (l); i >= (r); i --)
#define Lep(i, l, r) for(int i = (l); i <  (r); i ++)
//#define debug(...) fprintf (stderr, __VA_ARGS__)
#define debug(...) 

using i64 = long long;
using ld = long double;
using LL = long long;
using ui64 = unsigned long long;
using ull = unsigned long long;

const int P = 998244353;
inline int mod(int x) { return x + (x >> 31 & P); }
inline void pls(int &x, int y) { x = mod(x + y - P); }
inline void sub(int &x, int y) { x = mod(x - y); }
inline int  add(int x, int y) { return mod (x + y - P); }
inline int  dec(int x, int y) { return mod (x - y); }
template <typename T> inline void ckmin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline void ckmax(T &x, T y) { if (x < y) x = y; }

inline int power(int x, int k) {
	int res = 1;
	while(k) {
		if (k & 1) res = 1ll * res * x % P;
		x = 1ll * x * x % P; k >>= 1;
	} return res;
}

const int N = 1000 + 5;
const int MV = 1e4;
const int B = 100 + 2;
const int inf = -0x3f3f3f3f;

int dp[2][3][B + 5][B + 5];
auto f = dp[0], g = dp[1];

void solve() {
	int n;
	cin >> n;
	vector<array<int, 3> > a(n + 1);
	lep (i, 1, n) lep (j, 0, 2) cin >> a[i][j];
	lep (o, 0, 1) lep (i, 0, 2) lep (j, 0, B) lep (k, 0, B) dp[o][i][j][k] = 0;
	
	lep (i, 0, n - 1) {
		lep (j, 0, 2) lep (x, 0, min (i + 1, B)) lep (y, 0, min (i + 1, B)) g[j][x][y] = 0;
		lep (j, 0, 2) lep (x, 0, min (i, B)) lep (y, 0, min(i, B)) {
			int dx, dy;
			if (x == 0) dx = 0; else dx = x + 1;
			if (y == 0) dy = 0; else dy = y + 1;
			ckmax(g[j][dx][dy], f[j][x][y] - dx - dy + a[i + 1][j]);
			ckmax(g[(j + 1) % 3][dy][1], f[j][x][y] - 1 - dy + a[i + 1][(j + 1) % 3]);
			ckmax(g[(j + 2) % 3][1][dx], f[j][x][y] - dx - 1 + a[i + 1][(j + 2) % 3]);
		}
		swap (f, g);
	}

	int ans = 0;
	lep (j, 0, 2) lep (x, 0, B) lep (y, 0, B) ckmax(ans, f[j][x][y]);
	cout << ans << '\n';
}

signed main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int Case;
	cin >> Case;
	while (Case --) solve();
	return 0;
}