#include<bits/stdc++.h>
#define ll long long
#define db double
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define FR first
#define SE second
#define il inline
using namespace std;
inline int read() {
  int x = 0; bool op = false;
  char c = getchar();
  while(!isdigit(c))op |= (c == '-'), c = getchar();
  while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return op ? -x : x;
}
il bool chkmax(int &a, int b) {return (b > a ? a = b, true : false);}
const int N = 1e3 + 10;
const int INF = 1e9;
const int T = 1e4;
int n;
int a[N][3], f[2][3][N][N], val[N];
// int calc(int x) {return (x + 1) * x >> 1;}
void solve() {
  n = read();
  for(int i = 1; i <= n; i++) {
    for(int j = 0; j < 3; j++) {
      a[i][j] = read();
    }
  }
  for(int j = 0; j < 3; j++) {
    for(int x = 0; x <= n; x++) {
      for(int y = 0; y <= n; y++) {
        f[0][j][x][y] = -INF;
      }
    }
  }
  f[0][0][0][0] = 0;
  for(int i = 1; i <= n; i++) {
    vector<int> st = {0, i};
    for(int j = i - 1; j && val[i - 1 - j] <= T; j--)st.pb(j);
    // printf("now:%d\n", i);
    for(int j = 0; j < 3; j++) {
      for(int x : st)for(int y : st) {
        f[1][j][x][y] = f[0][j][x][y];
        f[0][j][x][y] = -INF;
        // printf("f:%d %d %d %d\n", j, x, y, f[1][j][x][y]);
      }
    }
    for(int j = 0; j < 3; j++) {
      for(int x : st)for(int y : st) {
        if(f[1][j][x][y] > -INF) {
          chkmax(f[0][j][x][y], f[1][j][x][y]);
          int c[3] = {x, y, i - 1};
          rotate(c, c + 3 - (j + 1), c + 3);
          for(int k = 0; k < 3; k++) {
            int d[3] = {c[0], c[1], c[2]};
            int v = a[i][k] - (!d[k] ? 0 : val[i - 1 - d[k]]); 
            d[k] = i; rotate(d, d + k, d + 3);
            chkmax(f[0][k][d[1]][d[2]], f[1][j][x][y] + v);
          }
        }
      }
    }
  }
  int ans = 0;
  for(int i = 0; i <= n; i++) {
    for(int j = 0; j <= n; j++) {
      int v = 0;
      if(i)v -= val[n - i];
      if(j)v -= val[n - j];
      chkmax(ans, max({f[0][0][i][j], f[0][1][i][j], f[0][2][i][j]}) + v);
    }
  }
  printf("%d\n", ans);
  return ;
}
signed main() {
  for(int i = 1; i < N; i++)val[i] = val[i - 1] + i;
  int test = read();
  while(test--)solve();
  return 0;
}