#include <bits/stdc++.h>

#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cmath>

using namespace std;

#define For(i,j,n) for(int i=j;i<=n;i++)

#define mst(ss,b) memset(ss,b,sizeof(ss));

typedef  long long LL;

template<class T> void read(T&num) {

    char CH; bool F=false;

    for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar());

    for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar());

    F && (num=-num);

}

int stk[70], tp;

template<class T> inline void print(T p) {

    if(!p) { puts("0"); return; }

    while(p) stk[++ tp] = p%10, p/=10;

    while(tp) putchar(stk[tp--] + '0');

    putchar('\n');

}

const LL mod=1e9+7;

const double PI=acos(-1.0);

const int inf=1e9;

const int N=3e6+10;

const int maxn=3e6;

const double eps=1e-10;

int a[152][152],up[152][152];

int n,m,sum[153];

int main()

{

        int t;

        read(t);

        while(t--)

        {

            read(n);;

            For(i,1,n)

            For(j,1,n)

            {

                read(a[i][j]);

                a[i][j+n]=a[i+n][j]=a[i+n][j+n]=a[i][j];

            }

            For(i,1,2*n)

                For(j,1,2*n)

                        up[i][j]=up[i-1][j]+a[i][j];

            int ans=-inf;

            For(i,1,n)

            {

                For(j,i,i+n-1)

                {

                    For(k,1,2*n)sum[k]=sum[k-1]+up[j][k]-up[i-1][k];

                    For(l,1,n)

                        For(r,l,l+n-1)

                            ans=max(ans,sum[r]-sum[l-1]);

                }

            }

            cout<<ans<<endl;

        }

        return 0;

}