#include<bits/stdc++.h>
using namespace std;
int t,n,a[505][505],ans;
int v[4][4];
void dfs(int x,int y,int sum,array<int,4> fl)
{
	if(y==4)
	{
		dfs(x+1,1,sum,fl);
		return ;
	}
	if(x==4)
	{
		if(*min_element(fl.begin(),fl.end())==1)
		{
			ans=min(ans,sum);
		}
		return ;
	}
	dfs(x,y+1,sum,fl);
	auto nxt=fl;
	if(x<=2&&y<=2) nxt[0]=1;
	if(x>=2&&y<=2) nxt[1]=1;
	if(x<=2&&y>=2) nxt[2]=1;
	if(x>=2&&y>=2) nxt[3]=1;
	dfs(x,y+1,sum+v[x][y],nxt);
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>t;
	while(t--)
	{
		cin>>n;
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n;j++)
			{
				cin>>a[i][j];
			}
		}
		if(n==1)
		{
			cout<<a[1][1]<<"\n";
			continue ;
		}
		ans=a[n/2+1][n/2+1];
		memset(v,0x3f,sizeof(v));
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n;j++)
			{
				int v1,v2;
				if(i<=n/2) v1=1;
				if(i==n/2+1) v1=2;
				if(i>n/2+1) v1=3;
				if(j<=n/2) v2=1;
				if(j==n/2+1) v2=2;
				if(j>n/2+1) v2=3;
				v[v1][v2]=min(v[v1][v2],a[i][j]); 
			}
		}
		dfs(1,1,0,{0,0,0,0});
		cout<<ans<<"\n";
	}
}