https://cn.vjudge.net/problem/Gym-101853E
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=1e5+9;
const int mod=1e9+7;
int dp[18][(1<<16)+100];
int val[18][(1<<16)+100];
int a[20][20];
vector<int>vec;
int n;
bool chh(int x,int y)
{
if(x&y) return 0;
if((x>>1)&y) return 0;
if((y>>1)&x) return 0;
return 1;
}
bool ch(int x)
{
if((x)&(x>>1)) return 0;
return 1;
}
void init(int n)
{
for(int i=0;i<(1<<n);i++)
{
if(ch(i)) vec.pb(i);
}
}
int main()
{
FAST_IO;
//freopen("input.txt","r",stdin);
int T;
//sfi(T);
cin>>T;
while(T--)
{
vec.clear();
cin>>n;
init(n);
for(int i=0;i<n;i++)
{
for(int s=0;s<(1<<n);s++) dp[i][s]=-INF,val[i][s]=0;
}
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++) cin>>a[i][j];
}
for(int i=0;i<n;i++)
{
for(int j=0;j<vec.size();j++)
{
int s=vec[j];
for(int k=0;k<n;k++)
{
if((1<<k)&s) val[i][j]+=a[i][k];
}
}
}
for(int i=0;i<vec.size();i++) dp[0][i]=val[0][i];
for(int i=1;i<n;i++)
{
for(int j=0;j<vec.size();j++)
{
for(int k=0;k<vec.size();k++)
{
if(chh(vec[j],vec[k]))
{
dp[i][j]=max(dp[i][j],dp[i-1][k]+val[i][j]);
}
}
}
}
int ans=0;
for(int i=0;i<vec.size();i++) ans=max(ans,dp[n-1][i]);
cout<<ans<<endl;
}
return 0;
}