#include<bits/stdc++.h>

using namespace std;

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define ll long long
void solve(){
    int n;
    cin >> n;
    vector<array<int, 3>>a(n + 1);
    irep(i, 1, n){
        cin >> a[i][0] >> a[i][1] >> a[i][2];
    }
    map<array<int, 4>, ll> f;
    ll ans = 0;
    queue<array<int, 4>>stk;
    function<void(int, int, int, int)> work = [&](int i, int j, int k, int l) -> void{
        if(j > 100 || k > 100 || l > 100)return;
        if(i == n)ans = max(ans, f[{i, j, k, l}]);
        if(i + 1 <= n){
            //choose j
            int J = j, K = k, L = l, del = 0, cur = f[{i, j, k, l}];
            J = 0, del += a[i + 1][0];
            if(k != -1)K = k + 1, del -= K;
            if(l != -1)L = l + 1, del -= L;
            f[{i + 1, J, K, L}] = max(f[{i + 1, J, K, L}], 1ll * cur + del);
            stk.push({i + 1, J, K, L});
            // choose k
            J = j, K = k, L = l, del = 0;
            if(j != -1)J = j + 1, del -= J;
            K = 0, del += a[i + 1][1];
            if(l != -1)L = l + 1, del -= L;
            f[{i + 1, J, K, L}] = max(f[{i + 1, J, K, L}], 1ll * cur + del);
            stk.push({i + 1, J, K, L});
            // choose l
            J = j, K = k, L = l, del = 0;
            if(j != -1)J = j + 1, del -= J;
            if(k != -1)K = k + 1, del -= K;
            L = 0, del += a[i + 1][2];
            f[{i + 1, J, K, L}] = max(f[{i + 1, J, K, L}], 1ll * cur + del);
            stk.push({i + 1, J, K, L});
        }
        return;
    };
    f[{0, -1, -1, -1}] = 0;
    stk.push({0, -1, -1, -1});
    while(stk.size()){
        auto [aa,bb,cc,dd] = stk.front();
        work(aa, bb, cc, dd);
        stk.pop();
    }
    cout << ans << '\n';
    return;
}

int main(){
    int TestCase;
    cin >> TestCase;
    while(TestCase --){
        solve();
    }
    return 0;
}