#include <bits/stdc++.h>
#pragma GCC optimize(3)
#define int long long
#define llu unsigned long long
#define endl "\n"
#define inf 0x3f3f3f3f
#define debug cout << "****************" << endl
using namespace std;

typedef pair<int, int> PII;

const int N = 1010;

const int m = 201;
// int dp[210][210][210];
// int f[210][210][210];

void solve()
{
    int n;
    cin >> n;
    vector<vector<vector<int>>> f(m + 5, vector<vector<int>>(m + 5, vector<int>(m + 5, 0)));
    vector<vector<vector<int>>> dp(m + 5, vector<vector<int>>(m + 5, vector<int>(m + 5, 0)));

    int ans = 0;
    vector<array<int, 4>> a(n + 7);
    for (int i = 1; i <= n; i++)
        cin >> a[i][1] >> a[i][2] >> a[i][3];

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= 3; j++)
        {
            for (int t1 = 0; t1 <= m && t1 <= i; t1++)
            {
                for (int t2 = 0; t2 <= m && t2 <= i; t2++)
                {
                    if (j == 1)
                    {
                        ans = max(ans, dp[1][(t1 ? t1 + 1 : 0)][t2 ? t2 + 1 : 0] = max(dp[1][(t1 ? t1 + 1 : 0)][t2 ? t2 + 1 : 0], f[1][t1][t2] + a[i][1] - t1 - t2));
                        ans = max(ans, dp[1][2][t2 ? t2 + 1 : 0] = max(dp[1][2][t2 ? t2 + 1 : 0], f[t1][1][t2] + a[i][1] - 1 - t2));
                        ans = max(ans, dp[1][t2 ? t2 + 1 : 0][2] = max(dp[1][t2 ? t2 + 1 : 0][2], f[t1][t2][1] + a[i][1] - 1 - t2));
                    }
                    if (j == 2)
                    {
                        ans = max(ans, dp[2][1][t2 ? t2 + 1 : 0] = max(dp[2][1][t2 ? t2 + 1 : 0], f[1][t1][t2] + a[i][2] - t2 - 1));
                        ans = max(ans, dp[(t1 ? t1 + 1 : 0)][1][t2 ? t2 + 1 : 0] = max(dp[(t1 ? t1 + 1 : 0)][1][t2 ? t2 + 1 : 0], f[t1][1][t2] + a[i][2] - t1 - t2));
                        ans = max(ans, dp[(t1 ? t1 + 1 : 0)][1][2] = max(dp[(t1 ? t1 + 1 : 0)][1][2], f[t1][t2][1] + a[i][2] - t1 - 1));
                    }
                    if (j == 3)
                    {
                        ans = max(ans, dp[2][(t1 ? t1 + 1 : 0)][1] = max(dp[2][(t1 ? t1 + 1 : 0)][1], f[1][t1][t2] + a[i][3] - t1 - 1));
                        ans = max(ans, dp[(t1 ? t1 + 1 : 0)][2][1] = max(dp[(t1 ? t1 + 1 : 0)][2][1], f[t1][1][t2] + a[i][3] - 1 - t1));
                        ans = max(ans, dp[(t1 ? t1 + 1 : 0)][t2 ? t2 + 1 : 0][1] = max(dp[(t1 ? t1 + 1 : 0)][t2 ? t2 + 1 : 0][1], f[t1][t2][1] + a[i][3] - t1 - t2));
                    }
                }
            }
        }
        swap(f, dp);
    }
    cout << ans << endl;
}

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