// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\033[32m[" << __LINE__ << "]\033[0m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T &x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T &x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = - f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 510, inf = 1e9;
int n, a[N][N];
void zhk() {
	read(n);
	int ans = inf;
	vector <int> t[3][3];
	F(i, 1, n)
		F(j, 1, n) {
			read(a[i][j]);
			int ti, tj;
			if (i < n / 2 + 1) ti = 0;
			else if (i == n / 2 + 1) ti = 1;
				else ti = 2;
			if (j < n / 2 + 1) tj = 0;
			else if (j == n / 2 + 1) tj = 1;
				else tj = 2;
			t[ti][tj].push_back(a[i][j]);
		}
	if (n == 1) {
		cout << t[1][1][0] << '\n';
		return;
	}
	F(i, 0, 2)
		F(j, 0, 2)
			sort(all(t[i][j]));
	chkmin(ans, t[1][1][0]);
	chkmin(ans, t[1][0][0] + t[1][2][0]);
	chkmin(ans, t[0][1][0] + t[2][1][0]);
	// debug << t[1][2][0] << " " << min(t[0][0][0], t[1][0][0]) << " " << min(t[2][0][0], t[1][0][0]) << endl;
	chkmin(ans, t[1][0][0] + min(t[0][2][0], t[0][1][0]) + min(t[2][2][0], t[2][1][0]));
	chkmin(ans, t[1][2][0] + min(t[0][0][0], t[0][1][0]) + min(t[2][0][0], t[2][1][0]));
	chkmin(ans, t[0][1][0] + min(t[2][0][0], t[1][0][0]) + min(t[2][2][0], t[1][2][0]));
	chkmin(ans, t[2][1][0] + min(t[0][0][0], t[1][0][0]) + min(t[0][2][0], t[1][2][0]));
	chkmin(ans, t[0][0][0] + t[2][0][0] + t[0][2][0] + t[2][2][0]);
	// {
	// 	vector <int> t;
	// 	F(i, 1, n) t.push_back(a[n / 2 + 1][i]);
	// 	sort(all(t));
	// 	chkmin(ans, t[0] + t[1]);
	// }
	// {
	// 	vector <int> t;
	// 	F(i, 1, n) t.push_back(a[i][n / 2 + 1]);
	// 	sort(all(t));
	// 	chkmin(ans, t[0] + t[1]);
	// }
	// {
	// 	vector <int> t;
	// 	F(i, 1, n / 2 + 1) t.push_back(a[i][n / 2 + 1]);
	// 	sort(all(t));
	// 	chkmin(ans, t[0] + t[1]);
	// }
	cout << ans << '\n';
}
signed main() {
	int _ = 1;
	cin >> _;
	while (_--) zhk();
	return 0;
}
/* why?
*/