#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long 
#define pb push_back
#define fo(i,N) for(int i = 0 ; i < N ; i++)
#define foo(i,x,N) for (int i = x; i < N ; i++)
#define fill(a,val) memset(a,val,sizeof(a))
#define fastio()  ios_base::sync_with_stdio(false); cin.tie(NULL);
#define endl '\n'
#define ff first
#define ss second
#define MAX 1234567
#define pii pair<int,int> 
#define pll pair<ll,ll> 
#define all(a) a.begin(),a.end()
int n;
int mat[13][6];


int solve(int i,int j)
{
  if ( i <= 0 || j <=0 || i > n || j > 5)
    return 0;

  int ans = mat[i][j];
  
  int temp = max(solve(i+1,j-1),max(solve(i+1,j+1),solve(i+1,j)));
  ans += temp;

  return ans;
}

int main()
{ 
  
   int t;
   cin >> t;
   while (t--)
   {
    cin >> n;
    for (int i = n ; i > 0 ; i--)
    {
      foo(j,1,6)
      cin >> mat[i][j];
    }

    foo(i,1,min(6,n+1))
    {
      foo(j,1,6)
      {
        if  ( mat[i][j] == -1)
        {
          mat[i][j] = 0;
        }
      }
    }

    // foo(i,1,n+1)
    // {
    //   foo(j,1,6)
    //   cout << mat[i][j] << " ";

    //   cout << endl;
    // }

    cout << max(max(solve(1,2),solve(1,4)),solve(1,3)) << endl;
    

   }
    


 
   

}