UVA10827

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 200,INF = -1e9;
int m[maxn][maxn], sum[maxn][maxn],n;

int main()
{
	int t;
	cin >> t;
	while (t--) {
		cin >> n;
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				cin >> m[i][j];
				m[i + n][j] = m[i][j + n] = m[i + n][j + n] = m[i][j];
			}
		}
		int len = (n << 1) + 1,ans = INF;
		for (int i = 1; i < len; i++) {
			for (int j = 1; j < len; j++) {
				sum[i][j] = m[i][j] + sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
				
				int a = min(i, n);
				int b = min(j, n);
				for (int k = 0; k <= a; k++) {
					for (int l = 0; l <= b; l++) {
						if (!k && !l)continue;
						ans = max(sum[i][j] - sum[i - k][j] - sum[i][j - l]+ sum[i - k][j - l],ans);
					}
				}
			}
		}
		cout << ans << endl;
	}
	return 0;
}